Determining the minimum crossing number of a link is NP-hard, via a reduction from the bipartite crossing number problem.
Elementary knot theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.