On a problem of effective knot theory
From MaRDI portal
Publication:1293092
algorithmtriangulationknot diagramnormal surfaceReidemeister movesnumber of crossingspolygonal knottrivial knot
Recommendations
Cited in
(18)- Roots and decompositions of three-dimensional topological objects
- Hard Diagrams of the Unknot
- Complexity of unknotting of trivial \(2\)-knots
- Towards effective topological field theory for knots
- Computing a link diagram from its exterior
- Local and algorithmic moves of knots according to Lackenby
- Unknotting unknots
- The unbearable hardness of unknotting
- New presentations of a link and virtual link
- Boundary-twisted normal form and the number of elementary moves to unknot
- On the unknotting problem
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- Unknotting rectangular diagrams of the trivial knot by exchange moves
- Knots, Reidemeister moves, and algorithms [after Lackenby]
- Obstructions to trivializing a knot
- Computing a link diagram from its exterior
- The number of Reidemeister moves needed for unknotting
- Algorithmic simplification of knot diagrams: new moves and experiments
This page was built for publication: On a problem of effective knot theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293092)