Lower bounds for myopic DPLL algorithms with a cut heuristic.
Dmitry ItsyksonDmitry SokolovPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- lower bound
- brute force
- search algorithm
- search strategies
- combinatorial optimization
- learning algorithm
- running times
- exact algorithms
- upper and lower bounds
- lower and upper bounds
- orders of magnitude
- optimization problems
- upper bound
- np complete
- heuristic methods
- computational complexity
- data structure
- objective function
- genetic algorithm