Name
Abstract | ||
|---|---|---|
We show that the problem of recognising a partitionable simplicial complex is a member of the complexity class NP, thus answering a question raised by Kleinschmidt and Onn (1995). |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00248-U | Discrete Mathematics |
Keywords | Field | DocType |
partitionable simplicial complex,simplicial complex,preprint,complexity class | Complexity class,Discrete mathematics,Combinatorics,Simplicial homology,Simplicial complex,h-vector,Delta set,Mathematics,Abstract simplicial complex | Journal |
Volume | Issue | ISSN |
152 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.73 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. D. Noble | 1 | 83 | 9.56 |