Link Crossing Number is NP-hard

@article{Mesmay2019LinkCN,
  title={Link Crossing Number is NP-hard},
  author={A. D. Mesmay and M. Schaefer and E. Sedgwick},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.04073}
}
  • A. D. Mesmay, M. Schaefer, E. 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.
    SHOWING 1-10 OF 14 REFERENCES
    Synapse - specific , long - term facilita - lation in development
      A new cul
      • 1932
      Some Conditionally Hard Problems on Links and 3-Manifolds
      10
      Elementary knot theory
      14
      The efficient certification of knottedness and Thurston norm
      25
      The Graph Crossing Number and its Variants: A Survey
      96
      AN UPPER BOUND
      11