Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT.
Daniel RolfPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- dynamic programming
- worst case
- improved algorithm
- experimental evaluation
- learning algorithm
- computational cost
- theoretical analysis
- k means
- significant improvement
- np hard
- computational complexity
- optimal solution
- linear programming
- preprocessing
- cost function
- clustering method
- high accuracy
- search space
- times faster
- detection algorithm
- optimization algorithm
- error bounds
- simulated annealing
- variable ordering
- stochastic local search
- tree structure
- input data
- probabilistic model
- objective function
- bayesian networks