 |
Problem of the Week
BUGCAT
Zassenhaus Conference
Hilton Memorial Lecture
BingAWM
Math Club
Actuarial Association
Sidebar
seminars:comb:abstract.201802dob
Michael Dobbins (Binghamton)
Shellability is NP-Complete
Abstract for the Combinatorics Seminar 2018 February 6
In “Shellability is NP-complete” by X. Goaoc, P. Paták, Z. Patáková, M. Trancer, and U. Wagner, the authors show NP-completeness of deciding whether a given pure simplicial complex of dimension at least 2 is shellable. Moreover, they show this for contractible pure simplicial complexes of dimension at least 3.
seminars/comb/abstract.201802dob.txt · Last modified: 2020/01/29 14:03 (external edit)