d-collapsibility is NP-complete for d>=4.
Martin TancerPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- pspace complete
- constraint satisfaction problems
- conjunctive queries
- polynomial time complexity
- computational complexity
- phase transition
- np complete problems
- data complexity
- sat problem
- bounded treewidth
- polynomially solvable
- databases
- probability distribution
- search space
- expert systems
- data mining