Keyphrases
- np hard
- scheduling problem
- special case
- approximation algorithms
- linear programming
- optimal solution
- cellular automata
- computational complexity
- error correction
- probabilistic automata
- closely related
- np complete
- lower bound
- worst case
- constraint satisfaction problems
- np hardness
- finite automata
- finite state
- computationally hard
- remains np hard
- knapsack problem
- database systems
- finite state machines
- branch and bound algorithm
- set cover
- tree automata
- decision trees
- boolean variables
- databases
- database