ArticleProceedings of the National Academy of Sciences of the United States of America2026
A parallel algorithm for the computation of the Jones polynomial.
Article in Proceedings of the National Academy of Sciences of the United States of America, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Knots, links, and entangled filaments appear in many physical systems in biology and engineering and their structural complexity is related to their function. In the context of emerging AI capabilities in predicting new physical structures, as well as in assisting mathematical proofs, the efficient computation of topological invariants and other metrics of entanglement becomes a considerable barrier to scientific advances. The computation of common measures of topological complexity, such as the Jones polynomial, is #P-hard and of exponential time on the number of crossings in a knot(oid) (link(oid)) diagram. In this paper, we introduce a parallel algorithm for the exact computation of the Jones polynomial for (collections of) both open and closed simple curves in 3-space. We prove that this algorithm enables the exponential reduction of the computational time depending on the number of processors. We demonstrate the advantage of this algorithm by applying it to knots, as well as to systems of linear polymers in a melt obtained from molecular dynamics simulations. The method is general and might be applicable to other invariants and measures of complexity.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.