HPC detection computational hardness conjecture
Statement
Let be the hypergraphic planted clique model on vertices with fixed integer , and let denote the sum of Type-I and Type-II errors of a test. HPC detection conjecture. If, for some ,
then every sequence of polynomial-time tests satisfies
The conjecture asserts computational hardness below the square-root clique-size scale. Exhaustive search gives the statistical threshold, while spectral methods reach the square-root scale; the source notes that whether HPC detection is equivalently hard as planted-clique detection remains open.
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.