Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

On Algebraic Knots I : Computatability of Their Jones Polynomials(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)

On Algebraic Knots I : Computatability of Their Jones Polynomials(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)

Abstract

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. この論文は国立情報学研究所の電子図書館事業により電子化されました。

Powered by OpenAIRE graph
Found an issue? Give us feedback