Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
d-collapsibility is NP-complete for d ≥ 4 Martin Tancer∗ November 28, 2009 Abstract A simplicial complex is d-collapsible if it can be reduced to an
Add to Reading List
Document Date: 2016-02-04 05:53:37
Open Document
File Size: 281,04 KB
Share Result on Facebook
UPDATE
d-collapsibility is NP-complete for d ≥ 4 Martin Tancer∗ November 28, 2009 Abstract A simplicial complex is d-collapsible if it can be reduced to an