ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p∈(0,1)p\in(0,1) be constant. For each nn, let An:Gn→{0,1}A_n:G_n\to\{0,1\} be a randomized polynomial-time algorithm, and let knk_n be a sequence of positive integers satisfying

lim sup⁡n→∞log⁡nkn<12.\limsup_{n\to\infty}\log_n k_n<\frac{1}{2}.

For the planted clique detection problem, with null hypothesis H0:G∼G(n,p)H_0:G\sim G(n,p) and alternative hypothesis H1:G∼G(n,kn,p)H_1:G\sim G(n,k_n,p), the planted clique detection conjecture. Every such sequence of algorithms satisfies

lim inf⁡n→∞(PH0[An(G)=1]+PH1[An(G)=0])≥1.\liminf_{n\to\infty}\left(\mathbb{P}_{H_0}[A_n(G)=1]+\mathbb{P}_{H_1}[A_n(G)=0]\right)\geq 1.

This is the standard planted-clique hardness assumption underlying reductions for statistical-computational gaps; it asserts that polynomial-time algorithms cannot achieve nontrivial detection when the planted clique has size nβn^{\beta} with β<1/2\beta<1/2.

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.