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 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:54, 3 February 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
