The Computational Complexity of Classical Knot Recognition

2022/06/07 by Kazuhiro Ichihara, Ichihara, Kazuhiro, Yuya Nishimura +3
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Digital Image Processing Techniques #FOS: Mathematics #Geometric Topology (math.GT) #Hand Gesture Recognition Systems

paper · doi:10.48550/arxiv.2206.02988

openalex publication_date 2022/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The computational complexity of the solid torus core recognition problem
• A Novel Aprroach to Knot Classification
• Unsolved Problems in Virtual Knot Theory and Combinatorial Knot Theory
• Is a Knot Classification possible?
• An Algorithmic Approach to Classify Knots