The computational complexity of knot genus and spanning area
by
Ian Agol
,
Joel Hass
,
William Thurston
| Venue: | electronic), arXiv: math.GT/0205057. MR MR2219001 |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Agol_thecomputational,
author = {Ian Agol and Joel Hass and William Thurston},
title = {The computational complexity of knot genus and spanning area},
booktitle = {electronic), arXiv: math.GT/0205057. MR MR2219001},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We show that the problem of deciding whether a polygonal knot in a closed three-dimensional manifold bounds a surface of genus at most g is NP-complete. We also show that the problem of deciding whether a curve in a PL manifold bounds a surface of area less than a given constant C is NP-hard. 1.
