A parallel divide-and-conquer algorithm computes the Jones polynomial of knots, links, and open curves by subdividing into linkoids and grouping states, but the claimed exponential speedup is not rigorously established.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A parallel algorithm for the computation of the Jones polynomial
A parallel divide-and-conquer algorithm computes the Jones polynomial of knots, links, and open curves by subdividing into linkoids and grouping states, but the claimed exponential speedup is not rigorously established.