arXiv · 1809.10334
NP-hard problems naturally arising in knot theory
Abstract
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.
Explore related subjects
Keep this discovery
Dale Koenig, Anastasiia Tsvietkova. 2018-09-27. NP-hard problems naturally arising in knot theory. https://arxiv.org/abs/1809.10334
Cite the original work for its findings. Save a collection to share your selection of sources.