Link Crossing Number is NP-hard
arXiv:1908.04073
Abstract
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
arXiv:1908.04073
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.