Embeddability in R <sup>3</sup> is NP-hard (Q5133975)
From MaRDI portal
scientific article; zbMATH DE number 7273091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embeddability in R <sup>3</sup> is NP-hard |
scientific article; zbMATH DE number 7273091 |
Statements
Embeddability in R <sup>3</sup> is NP-hard (English)
0 references
11 November 2020
0 references
3-manifold
0 references
Dehn surgery
0 references
embedding
0 references
NP-hardness
0 references
computational topology
0 references
simplicial complex
0 references
