arXiv:2004.01471 [math.GT]AbstractReferencesReviewsResources
The computational complexity of determining knot genus in a fixed 3-manifold
Published 2020-04-03Version 1
We show that the problem of determining the genus of a knot in a fixed compact, orientable three-dimensional manifold lies in NP. This answers a question asked by Agol, Hass, and Thurston in 2002. Previously, this was known for rational homology three-spheres, by the work of the first author.
Comments: 38 pages, 6 figures
Categories: math.GT
Related articles: Most relevant | Search more
Reidemeister-Turaev torsion modulo one of rational homology three-spheres
Splitting formulas for the LMO invariant of rational homology three-spheres
arXiv:math/9807016 [math.GT] (Published 1998-07-03)
The Computational Complexity of Knot and Link Problems