d-collapsibility is NP-complete for d greater or equal to 4.
Martin TancerPublished in: Chic. J. Theor. Comput. Sci. (2010)
Keyphrases
- np complete
- randomly generated
- np hard
- constraint satisfaction problems
- pspace complete
- satisfiability problem
- computational complexity
- polynomially solvable
- conjunctive queries
- equal sized
- polynomial time complexity
- np complete problems
- data complexity
- special case
- significantly higher
- neural network
- scheduling problem
- search space
- learning algorithm