2007年4月
Fast algorithms for computing Jones polynomials of certain links
THEORETICAL COMPUTER SCIENCE
- ,
- ,
- ,
- 巻
- 374
- 号
- 1-3
- 開始ページ
- 1
- 終了ページ
- 24
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.tcs.2006.11.012
- 出版者・発行元
- ELSEVIER SCIENCE BV
We give a fast algorithm for computing Jones polynomials of 2-bridge links. Given the Tait graph with n edges of a 2-bridge diagram, this algorithm runs with O(n) additions and multiplications in polynomials of degree O(n), namely in O(n(2) log n) time. We also propose an algorithm that, given the Tait graph with n edges of a closed 3-braid diagram, computes the Jones polynomial of the closed 3-braid link in O(n(2) log n) time. (C) 2006 Elsevier B.V. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.tcs.2006.11.012
- ISSN : 0304-3975
- Web of Science ID : WOS:000246170000001