Preprint
Partitionability is NP-complete
Mathematics
Computer Science
Abstract
We show that the problem of deciding whether a simplicial complex is partitionable is NP-complete in dimensions two and higher, answering a 1995 question of Kleinschmidt and Onn.