Year: 2021
Type: article
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 k , finding a k k -component unlink as a sublink, and finding a k k -component alternating sublink.
DOI: 10.1090/btran/71
Authors: Dale Koenig, Anastasiia Tsvietkova
Institution: Rutgers, The State University of New Jersey
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,750
OpenAlex ID: W2892744577
