The Computational Complexity of Classical Knot Recognition
Kazuhiro Ichihara, Nishimura, Yuya, Seiichi Tani · Institutional Repositories DataBase (IRDB) · 2022
The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.