Link Crossing Number is NP-hard
Computational Geometry
2019-08-13 v1 Geometric Topology
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.
Cite
@article{arxiv.1908.04073,
title = {Link Crossing Number is NP-hard},
author = {Arnaud de Mesmay and Marcus Schaefer and Eric Sedgwick},
journal= {arXiv preprint arXiv:1908.04073},
year = {2019}
}