The computational complexity of the solid torus core recognition problem

DOI10.32917/h2023004MaRDI QIDQ6654239

Unnamed Author

Publication date: 18 December 2024

Published in: Hiroshima Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

knot theorycomputational topologynormal surface theory

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knot theory (57K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• An algorithm to decide if a 3-manifold is a Haken manifold
• Algorithms for the complete decomposition of a closed \(3\)-manifold
• The efficient certification of knottedness and Thurston norm
• On meridian-traceless \(\mathrm{SU}(2)\)-representations of link groups
• The computational complexity of knot and link problems
• Finding Cycles with Topological Properties in Embedded Graphs
• 3-manifold knot genus is NP-complete
• KNOTS IN THE SOLID TORUS UP TO 6 CROSSINGS

This page was built for publication: The computational complexity of the solid torus core recognition problem