arXiv (All)
open access
Partitionability is NP-complete
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Connected (Dense) Partition for Tree-Like Graphs#1402235
- A Proof of a Conjecture on Fixed Perimeter Partitions#635983
- A Proof of a Conjecture on Fixed Perimeter Partitions#633634
- Counterexamples to the Minimum Period Conjecture for Restricted Partition Functions#1387141
- Conditionals, indeterminacy, and triviality#744654
Record · ID 1402471
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive