Recognition of collapsible complexes is NP-complete
Computational Geometry
2015-10-08 v2
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.
Cite
@article{arxiv.1211.6254,
title = {Recognition of collapsible complexes is NP-complete},
author = {Martin Tancer},
journal= {arXiv preprint arXiv:1211.6254},
year = {2015}
}
Comments
21 pages, 13 figures (Appendix was reworked in version v2. Other changes are mainly in the introduction + numerous minor fixes.)