Dale Koenig, Anastasiia Tsvietkova
Published 2018-09-27Version 1
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link has an unlinking or splitting number $k$, finding a $k$-component unlink as a sublink, and finding a $k$-component alternating sublink.
New points of view in knot theory
The Trieste look at Knot Theory
Tutte Polynomials of Tensor Products of Signed Graphs and their Applications in Knot Theory
![QR code for arXiv:1809.10334 [math.GT]](http://oss.arxitics.com/images/favicon.svg)