The low-degree polynomial conjecture on computational indistinguishability
Statement
Let and denote a sequence of probability measures with sample space , where . Suppose that every polynomial of degree satisfying
is bounded under with high probability as , and that some further regularity conditions hold. Low-degree polynomial conjecture. There is no polynomial-time test distinguishing from with both type I and type II errors tending to as . The conjecture is a proposed computational lower-bound principle: control of all low-degree polynomials should rule out efficient tests, subject to the stated regularity conditions.
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.