The computational complexity of knot and link problems (Q3158535): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29011807, #quickstatements; #temporary_batch_1706897434465 |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Nicholas J. Pippenger / rank | |||
| Property / author | |||
| Property / author: Nicholas J. Pippenger / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068497209 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/9807016 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:26, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of knot and link problems |
scientific article |
Statements
The computational complexity of knot and link problems (English)
0 references
25 January 2005
0 references
