arXiv · math/0205057
The Computational Complexity of Knot Genus and Spanning Area
Abstract
We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show that deciding whether a curve in a metrized PL 3-manifold bounds a surface of area less than a given constant C is NP-hard.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ian Agol, Joel Hass, William P. Thurston. 2004-07-10. The Computational Complexity of Knot Genus and Spanning Area. https://searcharxiv.com/abs/math/0205057
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.