Link Crossing Number is NP-hard
published by Arnaud de Mesmay
in 2019
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.
Download