The Computational Complexity of Classical Knot Recognition
Geometric Topology
2022-06-08 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2206.02988,
title = {The Computational Complexity of Classical Knot Recognition},
author = {Kazuhiro Ichihara and Yuya Nishimura and Seiichi Tani},
journal= {arXiv preprint arXiv:2206.02988},
year = {2022}
}
Comments
54 pages, 36 figures