On a problem of effective knot theory
From MaRDI portal
algorithmknot diagramnormal surfacenumber of crossingspolygonal knotReidemeister movestriangulationtrivial knot
Recommendations
Cited in
(19)- Algorithmic unsolvability of the triviality problem for multidimensional knots
- Obstructions to trivializing a knot
- The unbearable hardness of unknotting
- The number of Reidemeister moves needed for unknotting
- Algorithmic simplification of knot diagrams: new moves and experiments
- Unknotting rectangular diagrams of the trivial knot by exchange moves
- Unknotting unknots
- On the unknotting problem
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- Local and algorithmic moves of knots according to Lackenby
- Roots and decompositions of three-dimensional topological objects
- Knots, Reidemeister moves, and algorithms [after Lackenby]
- Complexity of unknotting of trivial \(2\)-knots
- New presentations of a link and virtual link
- Towards effective topological field theory for knots
- Computing a link diagram from its exterior
- Computing a link diagram from its exterior
- Hard Diagrams of the Unknot
- Boundary-twisted normal form and the number of elementary moves to unknot
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)