Algorithms for SAT and Upper Bounds on Their Complexity
Evgeny DantsinEdward A. HirschSergei IvanovMaxim VsemirnovPublished in: Electron. Colloquium Comput. Complex. (2001)
Keyphrases
- upper bound
- worst case
- upper and lower bounds
- computational complexity
- high computational complexity
- theoretical analysis
- lower bound
- space complexity
- computational cost
- computationally efficient
- complexity analysis
- lower and upper bounds
- search algorithm
- branch and bound
- np hard
- learning algorithm
- supervised learning
- search strategies
- significant improvement
- evolutionary algorithm
- search space