Hypergraphic planted clique detection conjecture
Statement
Let be an order- hypergraph in the HPC detection problem, with null distribution and planted-clique alternative , where satisfies
A polynomial-time test is a sequence with . HPC conjecture. For every sequence of polynomial-time tests ,
Thus, when the planted clique size is below the stated threshold, no polynomial-time test can reliably distinguish the null hypergraph from the hypergraph with a planted clique. This computational hardness conjecture is used to derive computational limits for degree-corrected tensor block models; its resolution status is not specified 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.