On the complexity of torus knot recognition

From MaRDI portal



Abstract: We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class sfNPcapsfcoext−NP, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in sfNP under the same assumption, and that cabled knot detection and composite knot detection are unconditionally in sfNP. Our algorithms are based on recent work of Kuperberg and of Lackenby on detecting knottedness.




Cites work









This page was built for publication: On the complexity of torus knot recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120516)