Link Crossing Number is NP-hard

08/12/2019

∙

by   Arnaud de Mesmay, et al.

∙

0

∙

share

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.