Determining the minimum crossing number of a link is NP-hard, via a reduction from the bipartite crossing number problem.
The efficient certification of knottedness and Thurston norm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in a compact orientable 3-manifold is equal to a given integer is in NP. As a corollary, the problem of determining the genus of a knot in the 3-sphere is in NP. We also show that the problem of determining whether a compact orientable 3-manifold has incompressible boundary is in NP.
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Link Crossing Number is NP-hard
Determining the minimum crossing number of a link is NP-hard, via a reduction from the bipartite crossing number problem.