Pages that link to "Item:Q4829817"
From MaRDI portal
The following pages link to Recognition algorithms in knot theory (Q4829817):
Displaying 17 items.
- Computational topology: isotopic convergence to a stick knot (Q281736) (← links)
- Algorithms for low-dimensional topology (Q378696) (← links)
- A new algorithm for recognizing the unknot (Q1279535) (← links)
- A new way to represent links. One-dimensional formalism and untangling technology (Q1349056) (← links)
- Algorithmic unsolvability of the triviality problem for multidimensional knots (Q1816439) (← links)
- Coding of knots by \(T\)-graphs (Q2096179) (← links)
- Algorithms in low-dimensional topology: holonomic parametrization of knots (Q2439403) (← links)
- The braided Ptolemy-Thompson group is finitely presented. (Q2479723) (← links)
- Unrecognizability of manifolds (Q2498916) (← links)
- Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Q2819199) (← links)
- The conjugacy problem for groups of alternating prime tame links is polynomial-time (Q3127567) (← links)
- RECOGNIZING TEXTILE STRUCTURES BY FINITE TYPE KNOT INVARIANTS (Q3628094) (← links)
- Multiflypes of rectangular diagrams of links (Q5154183) (← links)
- Rectangular diagrams of Legendrian graphs (Q5174871) (← links)
- (Q5178716) (← links)
- Detecting Unknots via Equational Reasoning, I: Exploration (Q5495915) (← links)
- Distinguishing Legendrian knots in topological types 74, 948, 10136 with maximal Thurston–Bennequin number (Q6204569) (← links)