Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885)
From MaRDI portal
scientific article; zbMATH DE number 5267356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete |
scientific article; zbMATH DE number 5267356 |
Statements
Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (English)
0 references
24 April 2008
0 references
Simplicial Topology
0 references
Collapsing
0 references
Computational Complexity
0 references
NP-completeness
0 references
