The stronger secret-leakage planted clique conjecture
Statement
Let be sufficiently symmetric, and let denote the intersection-size distribution for two independent sets sampled from . Stronger Secret Leakage Planted Clique Conjecture. There is no polynomial-time algorithm solving if some function exists such that the tail bounds of the Secret Leakage Planted Clique Conjecture hold for every . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.