Link Crossing Number is NP-hard

@article{Mesmay2019LinkCN,
  title={Link Crossing Number is NP-hard},
  author={Arnaud de Mesmay and Marcus Schaefer and Eric Sedgwick},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.04073}
}
  • Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • 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. 

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.