Recognition algorithms in knot theory
From MaRDI portal
Recommendations
- Algorithms for recognizing knots and 3-manifolds
- scientific article; zbMATH DE number 1303213
- A new algorithm for recognizing the unknot
- The computational complexity of classical knot recognition
- On the complexity of torus knot recognition
- Low complexity algorithms in knot theory
- Algorithmic classification of 3-manifolds and knots
- The computational complexity of knot and link problems
- Algorithmic recognition of 3-manifolds
Cited in
(31)- A new algorithm for recognizing the unknot
- A new way to represent links. One-dimensional formalism and untangling technology
- Algorithms for recognizing knots and 3-manifolds
- Algorithmic unsolvability of the triviality problem for multidimensional knots
- Coding of knots by \(T\)-graphs
- On the normal form of knots
- Algorithms in low-dimensional topology: holonomic parametrization of knots
- The braided Ptolemy-Thompson group is finitely presented.
- Unrecognizability of manifolds
- Computational topology: isotopic convergence to a stick knot
- Efficient knot discrimination via quandle coloring with SAT and \#-SAT
- An efficient algorithm to decide the knot problem
- The conjugacy problem for groups of alternating prime tame links is polynomial-time
- The computational complexity of knot and link problems
- RECOGNIZING TEXTILE STRUCTURES BY FINITE TYPE KNOT INVARIANTS
- Algorithms for low-dimensional topology
- scientific article; zbMATH DE number 1303213 (Why is no real title available?)
- Recognizing Knots Using Simulated Annealing
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- scientific article; zbMATH DE number 1860721 (Why is no real title available?)
- Rectangular knot diagrams classification with deep learning
- Multiflypes of rectangular diagrams of links
- Rectangular diagrams of Legendrian graphs
- scientific article; zbMATH DE number 6415740 (Why is no real title available?)
- Algorithms for concatenating templates
- Computing invariants of knotted graphs given by sequences of points in 3-dimensional space
- Detecting Unknots via Equational Reasoning, I: Exploration
- Computing a link diagram from its exterior
- Distinguishing Legendrian knots in topological types 74, 948, 10136 with maximal Thurston–Bennequin number
- Recognizing trace graphs of closed braids
- Computing a link diagram from its exterior
This page was built for publication: Recognition algorithms in knot theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829817)