Recognition of collapsible complexes is NP-complete
Martin Tancer · arXiv (Cornell University) · 2012
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Francés showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.