Recognition of collapsible complexes is NP-complete
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\'es showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.