The computational complexity of basic decision problems in 3-dimensional topology

DOI10.1007/s10711-007-9210-4zbMath1146.57025OpenAlexW1992600635MaRDI QIDQ2481645

Sergei V. Ivanov

Publication date: 14 April 2008

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10711-007-9210-4

zbMATH Keywords

3-manifoldsComputational complexityNormal surfacesTriangulationsDecision problems

Mathematics Subject Classification ID

Related Items (8)

Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ Computing a link diagram from its exterior ⋮ On Conjectures of Andrews and Curtis ⋮ The intersection of subgroups in free groups and linear programming ⋮ The efficient certification of knottedness and Thurston norm ⋮ Unnamed Item ⋮ On the hardness of finding normal surfaces ⋮ On the complexity of torus knot recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• An alternative proof that 3-manifolds can be triangulated
• An algorithm to decide if a 3-manifold is a Haken manifold
• Foliations and the topology of 3-manifolds. III
• Recognizing the 3-sphere
• PL equivariant surgery and invariant decompositions of 3-manifolds
• 0-efficient triangulations of 3-manifolds
• Thin position and the recognition problem for \(S^ 3\)
• Algorithms for the complete decomposition of a closed \(3\)-manifold
• Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung
• The computational complexity of knot and link problems
• Knots are Determined by Their Complements
• Almost normal surfaces in 3-manifolds
• An algorithm for the recognition of 3-spheres (according to Thompson)
• The computational complexity of knot genus and spanning area

This page was built for publication: The computational complexity of basic decision problems in 3-dimensional topology