ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pn\mathbb{P}_n and Qn\mathbb{Q}_n denote a sequence of probability measures with sample space Rnk\mathbb{R}^{n^k}, where k=O(1)k=O(1). Suppose that every polynomial ff of degree O(log⁡n)O(\log n) satisfying

EQnf2=1\mathbb{E}_{\mathbb{Q}_n} f^2=1

is bounded under Pn\mathbb{P}_n with high probability as n→∞n\to\infty, and that some further regularity conditions hold. Low-degree polynomial conjecture. There is no polynomial-time test distinguishing Pn\mathbb{P}_n from Qn\mathbb{Q}_n with both type I and type II errors tending to 00 as n→∞n\to\infty. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.