Lower bound for the Complexity of the Boolean Satisfiability Problem.
Carlos Barron-RomeroPublished in: CoRR (2016)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- complexity analysis
- branch and bound algorithm
- database systems
- optimal solution
- branch and bound
- average case complexity
- computational complexity
- np hard
- lagrangian relaxation
- lower and upper bounds
- space complexity
- database
- data structure
- machine learning
- data mining
- real time