The computational complexity of classical knot recognition

被引：0

作者：

Ichihara, Kazuhiro ^{[1
]}

Nishimura, Yuya ^{[2
]}

Tani, Seiichi ^{[3
]}

机构：

[1] Nihon Univ, Coll Humanities & Sci, Dept Math, 3-25-40 Sakurajosui, Tokyo, Tokyo 1568550, Japan

[2] Hiroshima Univ, Grad Sch Adv Sci & Engn, 1-3-1 Kagamiyama, Higashi Hiroshima City, Hiroshima 7398526, Japan

[3] Nihon Univ, Coll Humanities & Sci, Dept Informat Sci, 3-25-40 Sakurajosui,Setagaya Ku, Tokyo 1568550, Japan

来源：

JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS | 2023年 / 32卷 / 11期

关键词：

Virtual knots; computational complexity; algorithms; 3-MANIFOLD; ALGORITHMS; TOPOLOGY; REGINA;

D O I：

10.1142/S0218216523500694

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页数：68

共 50 条

[1] ON THE COMPLEXITY OF TORUS KNOT RECOGNITION
Baldwin, John A.
Sivek, Steven
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 371 (06) : 3831 - 3855
[2] The computational complexity of knot and link problems
Hass, J
Lagarias, JC
Pippenger, N
JOURNAL OF THE ACM, 1999, 46 (02) : 185 - 211
[3] The computational complexity of knot and link problems
Hass, J
Lagarias, JC
Pippenger, N
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 172 - 181
[4] THE COMPUTATIONAL-COMPLEXITY OF KNOT AND MATROID POLYNOMIALS
WELSH, DJA
DISCRETE MATHEMATICS, 1994, 124 (1-3) : 251 - 269
[5] The computational complexity of knot genus and spanning area
Agol, Ian
Hass, Joel
Thurston, William
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2006, 358 (09) : 3821 - 3850
[6] Computational complexity of classical and quantum dynamics
Ivanov, IB
FIRST INTERNATIONAL SYMPOSIUM ON QUANTUM INFORMATICS, 2002, 5128 : 17 - 21
[7] The computational complexity of knot genus in a fixed 3-manifold
Lackenby, Marc
Yazdi, Mehdi
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2023, 126 (03) : 837 - 879
[8] Recognition complexity of theories and their computational expressivity
Latkin, I. V.
ALGEBRA AND LOGIC, 2012, 51 (02) : 144 - 159
[9] Recognition complexity of theories and their computational expressivity
I. V. Latkin
Algebra and Logic, 2012, 51 : 144 - 159
[10] Computational Complexity of Classical Solutions of Partial Differential Equations
Selivanova, Svetlana
REVOLUTIONS AND REVELATIONS IN COMPUTABILITY, CIE 2022, 2022, 13359 : 299 - 312

← 1 2 3 4 5 →