2 citations · 4 across the 10 of their papers we have counts for
Showing 1998Show all
2 papers · 1 filter
math.GT1998
The Computational Complexity of Knot and Link Problems
Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that…
math.GT1998
The number of Reidemeister Moves Needed for Unknotting
Joel Hass, Jeffrey C. Lagarias
There is a positive constant such that for any diagram representing the unknot, there is a sequence of at most Reidemeister moves that will convert it to a tr…