Recognition of Collapsible Complexes is NP-Complete.
Martin TancerPublished in: Discret. Comput. Geom. (2016)
Keyphrases
- np complete
- recognition rate
- randomly generated
- np hard
- object recognition
- recognition accuracy
- recognition algorithm
- feature extraction
- visual recognition
- constraint satisfaction problems
- computational complexity
- action recognition
- polynomial time complexity
- human activities
- conjunctive queries
- phase transition
- satisfiability problem
- pattern recognition
- data complexity
- pspace complete
- bounded treewidth
- microarray
- gesture recognition
- data sets