AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS (Q5483329)
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: AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS |
scientific article; zbMATH DE number 5045267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS |
scientific article; zbMATH DE number 5045267 |
Statements
AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS (English)
0 references
14 August 2006
0 references
digitalized knot representation
0 references
unknot
0 references
0.89466995
0 references
0.8796827
0 references
0.8746433
0 references
0.8727683
0 references
0 references
0.8638644
0 references
0.8620529
0 references
0.85214007
0 references
