Recognizing shrinkable complexes is NP-complete.
Dominique AttaliOlivier DevillersMarc GlisseSylvain LazardPublished in: J. Comput. Geom. (2016)
Keyphrases
- np complete
- randomly generated
- np hard
- pspace complete
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- np complete problems
- automatic recognition
- polynomial time complexity
- polynomially solvable
- bounded treewidth
- phase transition
- sat problem
- databases
- information systems
- critical points
- data integration
- cnf formula
- special case
- relational databases
- genetic algorithm
- neural network