| Presentation | 1999/9/6 A polynomial time algorithm to determine the highest degree of the Jones polynomial or a certain pretzel link Masao Hara, Sei'ichi Tani, Makoto Yamamoto, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | computatinal topplogy / Jones polynomial / pretzel link |
| Paper # | COMP99-34 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1999/9/6(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A polynomial time algorithm to determine the highest degree of the Jones polynomial or a certain pretzel link |
| Sub Title (in English) | |
| Keyword(1) | computatinal topplogy |
| Keyword(2) | Jones polynomial |
| Keyword(3) | pretzel link |
| 1st Author's Name | Masao Hara |
| 1st Author's Affiliation | Dept. of Mathematical Science Tokai Univ.() |
| 2nd Author's Name | Sei'ichi Tani |
| 2nd Author's Affiliation | Dept. of Applied Mathematics Nihon Univ. |
| 3rd Author's Name | Makoto Yamamoto |
| 3rd Author's Affiliation | Dept. of Mathematics Chuo Univ. |
| Date | 1999/9/6 |
| Paper # | COMP99-34 |
| Volume (vol) | vol.99 |
| Number (no) | 288 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |