The low-degree likelihood-ratio conjecture for computational indistinguishability
Statement
Let . For “nice” sequences of distributions and on spaces , let denote the likelihood ratio, and let be its orthogonal projection onto polynomials of degree at most under . A function strongly distinguishes from if
Low-degree likelihood-ratio conjecture. If remains bounded as whenever , then there is no sequence of functions computable in time that strongly distinguishes and . This conjecture formalizes the heuristic that degree- polynomials are as powerful as algorithms with runtime roughly , and is a central basis for using low-degree likelihood-ratio bounds to predict computational hardness.
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.