Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic.
Dmitry ItsyksonDmitry SokolovPublished in: ISAAC (2011)
Keyphrases
- lower bound
- learning algorithm
- data structure
- running times
- orders of magnitude
- combinatorial optimization
- brute force
- theoretical analysis
- worst case
- lower and upper bounds
- dynamic programming
- exact algorithms
- computational complexity
- tabu search
- genetic algorithm
- solution quality
- search tree
- exhaustive search
- upper and lower bounds
- propositional satisfiability