Shellability is NP-complete

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10384876" target="_blank" >RIV/00216208:11320/18:10384876 - isvavai.cz</a>
Result on the web
<a href="http://drops.dagstuhl.de/opus/volltexte/2018/8754/" target="_blank" >http://drops.dagstuhl.de/opus/volltexte/2018/8754/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.SoCG.2018.41" target="_blank" >10.4230/LIPIcs.SoCG.2018.41</a>

Result language
angličtina
Original language name
Shellability is NP-complete
Original language description
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d >= 2 and k >= 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d >= 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018)
ISBN
978-3-95977-066-8
ISSN
1868-8969
e-ISSN
neuvedeno
Number of pages
15
Pages from-to
1-15
Publisher name
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication
Daghstuhl, Germany
Event location
Budapešť
Event date
Jun 11, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)