Recognizing Shrinkable Complexes Is NP-Complete.
Dominique AttaliOlivier DevillersMarc GlisseSylvain LazardPublished in: ESA (2014)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- constraint satisfaction problems
- computational complexity
- pspace complete
- polynomially solvable
- conjunctive queries
- automatic recognition
- polynomial time complexity
- data complexity
- critical points
- special case
- multiscale
- information systems
- bounded treewidth
- np complete problems
- social networks
- computationally complex
- neural network