Recognition of collapsible complexes is NP-complete
classification
💻 cs.CG
keywords
complexnp-completecollapsibledecidegivensimplicialwhethercollapses
read the original abstract
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\'{e}s showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.