A polynomial time knot polynomial
Dror Bar-Natan, Roland van der Veen
TL;DR
This paper introduces the strongest known knot invariant that can be computed efficiently in polynomial time, advancing the computational tools available for knot theory.
Contribution
It presents a new knot invariant that is both powerful and computable in polynomial time, improving upon previous invariants.
Findings
The invariant is computable in polynomial time.
It is the strongest known invariant of its kind.
Potential applications in knot classification and topology.
Abstract
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.