Embeddability in $\mathbb{R}^3$ is NP-hard (Q4607974)
From MaRDI portal
scientific article; zbMATH DE number 6850395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embeddability in $\mathbb{R}^3$ is NP-hard |
scientific article; zbMATH DE number 6850395 |
Statements
15 March 2018
0 references
math.GT
0 references
cs.CG
0 references
