ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ρ\rho be sufficiently symmetric, and let pρ(s)p_\rho(s) denote the intersection-size distribution for two independent sets sampled from ρ\rho. Stronger Secret Leakage Planted Clique Conjecture. There is no polynomial-time algorithm solving \textscpcρ(n,k,1/2)\textsc{pc}_\rho(n,k,1/2) if some function w(n)=ωn(1)w(n)=\omega_n(1) exists such that the tail bounds of the Secret Leakage Planted Clique Conjecture hold for every d≤w(n)d\le w(n). This strengthens the usual conjecture by requiring the intersection-tail bounds only up to an arbitrary diverging degree parameter rather than up to polylogarithmic degree.

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.