The dense subgraph detection conjecture
Statement
Let be the set of graphs with vertices, and let and denote the null and alternative graph distributions, respectively. For a sequence satisfying for some , let , and consider tests , where and denote probabilities under the null and alternative hypotheses.
The dense subgraph detection conjecture. For any sequence of randomized polynomial-time tests ,
Equivalently, no randomized polynomial-time algorithm can correctly identify the dense subgraph with probability tending to . This conjecture is used to establish a computational lower bound for matrix logistic regression; its resolution is not given in the source.
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.