Pith. sign in

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 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Link Crossing Number is NP-hard

cs.CG · 2019-08-12 · conditional · novelty 8.0

Determining the minimum crossing number of a link is NP-hard, via a reduction from the bipartite crossing number problem.

citing papers explorer

Showing 1 of 1 citing paper.

  • Link Crossing Number is NP-hard cs.CG · 2019-08-12 · conditional · none · ref 4 · internal anchor

    Determining the minimum crossing number of a link is NP-hard, via a reduction from the bipartite crossing number problem.