Embeddability in \(\mathbb R^3\) is NP-hard (Q4607974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Embeddability in R^3 is NP-hard |
scientific article; zbMATH DE number 6850395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9846700429916382
0 references
0.8879742622375488
0 references
