New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems.
David A. PlaistedPublished in: Theor. Comput. Sci. (1984)
Keyphrases
- np complete
- np hard
- satisfiability problem
- randomly generated
- computational complexity
- constraint satisfaction problems
- polynomially solvable
- np complete problems
- fixed parameter tractable
- phase transition
- polynomial time complexity
- approximate solutions
- conjunctive queries
- lower bound
- optimal solution
- approximation algorithms
- neural network
- np hardness
- pspace complete
- scheduling problem
- constraint satisfaction
- linear programming
- bounded treewidth
- computationally challenging
- dynamic programming
- polynomial hierarchy
- minimum cost flow