
We prove that the Jones polynomial of any Conway algebraic link diagram with n crossings can be computed in O(n^2) time. In particular, the Jones polynomial of any Montesinos link and two-bridge knot or link with minimum crossing number n can be computed in O(n^2) time. この論文は国立情報学研究所の電子図書館事業により電子化されました。
