Keyphrases
- np complete
- knapsack problem
- np hard
- randomly generated
- satisfiability problem
- optimal solution
- dynamic programming
- constraint satisfaction problems
- computational complexity
- pspace complete
- lower bound
- conjunctive queries
- upper bound
- phase transition
- multiple choice
- polynomially solvable
- highly correlated
- data sets
- np complete problems
- polynomial time complexity
- database
- branch and bound algorithm
- feasible solution
- data complexity
- data management
- special case
- relational databases
- databases
- computationally complex