Recognizing Shrinkable Complexes Is NP-Complete

DOI10.1007/978-3-662-44777-2_7zbMath1423.68535OpenAlexW3013989620MaRDI QIDQ2921395

Olivier Devillers, Sylvain Lazard, Marc Glisse, Dominique Attali

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_7

Mathematics Subject Classification ID

General topology of complexes (57Q05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Recognizing Shrinkable Complexes Is NP-Complete