Recognition of Collapsible Complexes is NP-Complete
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10320321" target="_blank" >RIV/00216208:11320/16:10320321 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00454-015-9747-1" target="_blank" >http://dx.doi.org/10.1007/s00454-015-9747-1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00454-015-9747-1" target="_blank" >10.1007/s00454-015-9747-1</a>
Alternative languages
Result language
angličtina
Original language name
Recognition of Collapsible Complexes is NP-Complete
Original language description
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,s showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete and Computational Geometry
ISSN
0179-5376
e-ISSN
—
Volume of the periodical
55
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
21-38
UT code for WoS article
000367625500002
EID of the result in the Scopus database
2-s2.0-84953348258