| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872517 | Discrete Applied Mathematics | 2014 | 14 Pages |
Abstract
We propose an algorithm for computing HOMFLY polynomials of 2-bridge links from 4-plat representation in O(n3) time, where n is the number of the crossings of a given input diagram.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Masahiko Murakami, Fumio Takeshita, Seiichi Tani,