Embeddability in R <sup>3</sup> is NP-hard (Q5133975): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105336413, #quickstatements; #temporary_batch_1707161894653 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3396593 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3033818404 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:26, 20 March 2024
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
