Embeddability in $\mathbb{R}^3$ is NP-hard (Q4607974): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1708.07734 / rank | |||
Normal rank | |||
Latest revision as of 19:55, 19 April 2024
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
