Searching for "3-MANIFOLD KNOT GENUS is NP-complete." – sorted by Relevance.
-
The computational complexity of knot genus and spanning area
- that the problem of determining a bound on the genus of a knot in a 3-manifold is NP-complete. Using similar ideas
- Cited by 1 (0 self) – Add To MetaCart

