The computational complexity of classical knot recognition (Q6181209)
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: The computational complexity of classical knot recognition |
scientific article; zbMATH DE number 7782611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of classical knot recognition |
scientific article; zbMATH DE number 7782611 |
Statements
The computational complexity of classical knot recognition (English)
0 references
2 January 2024
0 references
virtual knots
0 references
computational complexity
0 references
algorithms
0 references
0.8552067875862122
0 references
0.8426292538642883
0 references
0.8187204599380493
0 references
0.8178690671920776
0 references
0.8154364228248596
0 references
