The computational complexity of classical knot recognition
Journal of Knot Theory and Its Ramifications Volume 32 Issue 11
Page 2350069-
published_at 2023-10-10
アクセス数 : 2 件
ダウンロード数 : 2 件
今月のアクセス数 : 2 件
今月のダウンロード数 : 2 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00056159
| File | |
| Title ( eng ) |
The computational complexity of classical knot recognition
|
| Creator |
Ichihara Kazuhiro
Nishimura Yuya
Tani Seiichi
|
| Source Title |
Journal of Knot Theory and Its Ramifications
|
| Volume | 32 |
| Issue | 11 |
| Start Page | 2350069 |
| 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 |
Virtual knots
computational complexity
algorithms
|
| Language |
eng
|
| Resource Type | journal article |
| Publisher |
World Scientific Publishing
|
| Date of Issued | 2023-10-10 |
| Rights |
Electronic version of an article published as Journal of Knot Theory and Its Ramifications, 32, 11, 2023, 2350069, https://doi.org/10.1142/S0218216523500694, © copyright World Scientific Publishing Company
This is not the published version. Please cite only the published version.
この論文は出版社版ではありません。引用の際には出版社版をご確認、ご利用ください。
|
| Publish Type | Accepted Manuscript |
| Access Rights | open access |
| Source Identifier |
[DOI] https://doi.org/10.1142/S0218216523500694
isVersionOf
|
