Collapsibility to a subcomplex of a given dimension is NP-complete.
Giovanni PaoliniPublished in: CoRR (2017)
Keyphrases
- np complete
- satisfiability problem
- np hard
- randomly generated
- pspace complete
- data complexity
- computational complexity
- polynomially solvable
- constraint satisfaction problems
- np complete problems
- data sets
- conjunctive queries
- scheduling problem
- xml documents
- phase transition
- computationally complex
- polynomial time complexity
- fixed parameter tractable
- bounded treewidth
- finds an optimal solution
- sat problem
- lower bound
- image sequences
- artificial intelligence
- learning algorithm
- machine learning
- neural network