Partitionability is NP-complete
Overview & Synopsis
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.
Indexed from repository: arXiv
(
arxiv.org)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Partitionability is NP-complete |
|---|---|
| Author / Organization | Russ Woodroofe |
| Subject & Discipline | math.CO |
| Categories | Science & Mathematics |
| Publication Year | 2026 |
| License / Rights | arXiv Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
arXiv
(arxiv.org)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-272152 |
| Original Source Link | Visit Source Page on arxiv.org » |