Keyphrases
- np hard
- lower bound
- optimal solution
- special case
- approximation algorithms
- scheduling problem
- minimum cost
- boolean functions
- np complete
- np hardness
- formal proofs
- closely related
- greedy heuristic
- branch and bound algorithm
- remains np hard
- linear programming
- theorem prover
- theorem proving
- worst case
- formal proof
- model counting
- computational complexity
- decision problems
- knowledge compilation
- ordered binary decision diagrams
- knapsack problem
- constraint satisfaction problems