FPRAS hardness conjecture for Jones polynomial evaluation
Statement
For an integer with , let , and let denote the Jones polynomial of a link evaluated at . An FPRAS is a fully polynomial randomized approximation scheme, and and are the standard randomized and nondeterministic polynomial-time complexity classes.
Jones-polynomial FPRAS conjecture. There is no FPRAS for evaluating except at the special points , provided .
At the exceptional points the Jones polynomial degenerates to a classical link invariant computable in polynomial time, whereas exact evaluation is -hard at the other roots of unity described in the paper. The conjecture concerns the stronger approximation-complexity question.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.