Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT
Daniel RolfPublished in: Electron. Colloquium Comput. Complex. (2005)
Keyphrases
- improved algorithm
- detection algorithm
- objective function
- optimization algorithm
- computational complexity
- k means
- cost function
- computational cost
- segmentation algorithm
- high accuracy
- worst case
- experimental evaluation
- dynamic programming
- np hard
- orders of magnitude
- matching algorithm
- times faster
- optimal solution
- clustering algorithm
- probabilistic model
- search space
- theoretical analysis
- lower bound
- preprocessing
- data structure
- clustering method
- stochastic local search algorithms