An efficient algorithm to decide the knot problem

MaRDI QIDQ3018138zbMATH OpenFDO

Authors Günter Hotz

Publication date 21 July 2011

Mathematics Subject Classification ID

Recommendations

• Recognition algorithms in knot theory
• The computational complexity of knot and link problems
• Algorithms for low-dimensional topology
• Low complexity algorithms in knot theory
• Automata on Gauss Words

Cited in

(8)

• A new algorithm for recognizing the unknot
• Meander diagrams of knots and spatial graphs: proofs of generalized Jablan-Radović conjectures
• On the normal form of knots
• Algorithms in low-dimensional topology: holonomic parametrization of knots
• Efficient algorithms to decide tightness
• Automata on Gauss Words
• Algorithms for low-dimensional topology
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

This page was built for publication: An efficient algorithm to decide the knot problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018138)