The computational complexity of knot and link problems

@article{Hass1999TheCC,
  title={The computational complexity of knot and link problems},
  author={J. Hass and J. Lagarias and N. Pippenger},
  journal={J. ACM},
  year={1999},
  volume={46},
  pages={185-211}
}
  • J. Hass, J. Lagarias, N. Pippenger
  • Published 1999
  • Computer Science, Mathematics
  • J. ACM
  • We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, ie., capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, UNKNOTTING PROBLEM is in NP. We also consider the problem, SPLITTING PROBLEM of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show… CONTINUE READING
    192 Citations

    Paper Mentions

    3-MANIFOLD KNOT GENUS is NP-complete
    • 9
    • PDF
    Computing closed essential surfaces in knot complements
    • 17
    • PDF
    Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
    • 22
    • Highly Influenced
    • PDF
    The computational complexity of basic decision problems in 3-dimensional topology
    • 20
    • Highly Influenced
    The complexity of the normal surface solution space
    • B. Burton
    • Mathematics, Computer Science
    • SoCG '10
    • 2010
    • 15
    • PDF
    The Next 350 Million Knots
    • B. Burton
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2020
    • 3
    • PDF
    Enumerating fundamental normal surfaces: Algorithms, experiments and invariants
    • B. Burton
    • Mathematics, Computer Science
    • ALENEX
    • 2014
    • 4
    • Highly Influenced
    • PDF
    Pachner moves, generic complexity, and randomising 3-manifold triangulations
    • 6
    • PDF
    A new algorithm for recognizing the unknot
    • 41
    • Highly Influenced
    • PDF
    Recognition algorithms in knot theory
    • 13

    References

    SHOWING 1-10 OF 19 REFERENCES
    A polynomial invariant for knots via von Neumann algebras
    • 1,395
    • Highly Influential
    • PDF
    New points of view in knot theory
    • 284
    • Highly Influential
    • PDF
    On the computational complexity of the Jones and Tutte polynomials
    • 432
    • Highly Influential
    The Knot Book
    • 560
    • Highly Influential
    Complexity: Knots, Colourings and Counting
    • 349
    • Highly Influential
    The Polynomial-Time Hierarchy
    • L. Stockmeyer
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1976
    • 1,310
    • Highly Influential
    The Classification of Knots and 3-Dimensional Spaces
    • 77
    • Highly Influential
    Theorie der Normalflächen
    • 357
    • Highly Influential
    Recent results on su?ciently large 3-manifolds
    • 6
    • Highly Influential
    Algorithms for the complete decomposition of a closed $3$-manifold
    • 127
    • Highly Influential