NP–hard problems naturally arising in knot theory
Work
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 Reidemeist... more
Authors Dale Koenig, Anastasiia Tsvietkova
Institution Rutgers, The State University of New Jersey
Cites: 15
Cited by: 4
Related to: 10
FWCI: 1.12
Citation percentile (by year/subfield): 56.07
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
APC paid (est): $2,750