# The computational complexity of knot and link problems

@article{Hass1999TheCC, title={The computational complexity of knot and link problems}, author={Joel Hass and Jeffrey C. Lagarias and Nicholas Pippenger}, journal={J. ACM}, year={1999}, volume={46}, pages={185-211} }

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…

## Figures and Topics from this paper

## 206 Citations

3-MANIFOLD KNOT GENUS is NP-complete

- Computer ScienceProceedings 17th IEEE Annual Conference on Computational Complexity
- 2002

The problem of deciding whether a polygonal knot in a closed triangulated three-dimensional manifold bounds a surface of genus at most g, 3-MANIFOLD KNOT GENUS is examined and it is shown that this problem is NP-complete.

Computing closed essential surfaces in knot complements

- Computer Science, MathematicsSoCG '13
- 2013

A new, practical algorithm to test whether a knot complement contains a closed essential surface, derived from the original Jaco-Oertel framework, involves both enumeration and optimisation procedures, and combines several techniques from normal surface theory.

Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces

- Mathematics, Computer ScienceTOMS
- 2012

Three methods for computing crosscap number are presented that offer varying trade-offs between precision and speed and an algorithm based on Hilbert basis enumeration and exact integer programming is presented, both of which either compute the solution precisely or reduce it to two possible values.

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

- Mathematics
- 2008

We study the computational complexity of basic decision problems of 3-dimensional topology, such as to determine whether a triangulated 3-manifold is irreducible, prime, ∂-irreducible, or…

Computing a link diagram from its exterior

- Mathematics
- 2021

A knot is circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the…

SOME CONDTIONALLY HARD PROBLEMS ON LINKS AND 3-MANIFOLDS

- 2015

Many decision problems in the theory of knots, links and 3-manifolds are known to be solvable. For example, the equivalence problem for links in the 3-sphere was solved by Haken [10], Hemion [13] and…

The Next 350 Million Knots

- Computer Science, MathematicsSoCG
- 2020

The many different algorithmic components in the tabulation of all prime knots draw on graph theory, hyperbolic geometry, knot polynomials, normal surface theory, and computational algebra, and the algorithm engineering challenges in solving difficult topological problems systematically and reliably on hundreds of millions of inputs are discussed.

The complexity of the normal surface solution space

- Computer Science, MathematicsSymposium on Computational Geometry
- 2010

A comprehensive analysis of millions of triangulations is undertaken and finds that in general the number of vertex normal surfaces is remarkably small, with strong evidence that the authors' pathological triangulation may in fact be the worst case scenarios.

Enumerating fundamental normal surfaces: Algorithms, experiments and invariants

- Mathematics, Computer ScienceALENEX
- 2014

This paper develops, implements and experimentally compare a primal and a dual algorithm, both of which combine domain-specific techniques with classical Hilbert basis algorithms, and indicates that they can solve extremely large problems that were once though intractable.

Pachner moves, generic complexity, and randomising 3-manifold triangulations

- Mathematics
- 2012

We study the computational complexity of decision problems on triangulated 3-manifolds. In this setting there has been encouraging initial progress in recent years, but many important questions…

## References

SHOWING 1-10 OF 66 REFERENCES

A new algorithm for recognizing the unknot

- Mathematics
- 1998

The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman…

The computational complexity of knot and link problems

- Computer Science
- 1999

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 ...

ON DEHN'S LEMMA AND THE ASPHERICITY OF KNOTS.

- Mathematics, MedicineProceedings of the National Academy of Sciences of the United States of America
- 1957

It is proved in this paper that Dehn's lemma holds for all orientable 3-manifolds and the hypotheses of the sphere theorem are fulfilled, according to the following NIELSEN-SCHREIER THEOREM.

The number of Reidemeister moves needed for unknotting

- Mathematics
- 1998

There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequence of at most 2 c1n Reidemeister moves that will convert it to a trivial knot diagram, where n is…

A trivial knot whose spanning disks have exponential size

- Computer Science, MathematicsSCG '90
- 1990

This paper investigates the minimum number of faces of a polyhedral spanning disk of apolygonal knot with n segments, and exhibits a knot whose minimal spanning disk has exp(<italic>cn</italic>) faces.

On the classification of homeomorphisms of 2-manifolds and the classification of 3-manifolds

- Mathematics
- 1979

Given two topological spaces, is it possible to determine whether they are homeomorphie ? This is the homeomorphism problem and most work in topology is directed toward some aspect of the…

A polynomial invariant for knots via von Neumann algebras

- Mathematics
- 1985

Thus, the trivial link with n components is represented by the pair (l ,n), and the unknot is represented by (si$2 * * • s n i , n) for any n, where si, $2, • • • > sn_i are the usual generators for…

On the computational complexity of the Jones and Tutte polynomials

- Mathematics
- 1990

We show that determining the Jones polynomial of an alternating link is #P-hard. This is a special case of a wide range of results on the general intractability of the evaluation of the Tutte…

PL equivariant surgery and invariant decompositions of 3-manifolds

- Mathematics
- 1989

Using normal surface theory [H,, J2], we introduce the notion of least weight normal surfaces. The weight of a normal surface is a nonnegative integer invariant of the normal isotopy class of the…

How to draw a planar graph on a grid

- Mathematics, Computer ScienceComb.
- 1990

It is shown that any setF, which can support a Fáry embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar.