Abstract:In this paper we extend the works of Tancer, Malgouyres and Francés, showing that (d, k)-Collapsibility is NP-complete for d ≥ k+2 except (2, 0). By (d, k)-Collapsibility we mean the following problem: determine whether a given d-dimensional simplicial complex can be collapsed to some k-dimensional subcomplex. The question of establishing the complexity status of (d, k)-Collapsibility was asked by Tancer, who proved NP-completeness of (d, 0) and (d, 1)-Collapsibility (for d ≥ 3). Our extended result, together … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.