Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5267356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.87855446
0 references
0.87038314
0 references
0.8450842
0 references
0.84083205
0 references
0.84083205
0 references
0.8371031
0 references
0.83549196
0 references
0.82682914
0 references
0.82682914
0 references
0.81757224
0 references
