HPDS recovery computational hardness conjecture
Statement
Let be a hypergraphic planted dense subgraph with , adjacency tensor , and recovery error . HPDS recovery conjecture. If
and
then every randomized polynomial-time algorithm satisfies
This conjecture says that the signal-to-noise requirement sufficient for the paper’s Aggregated-SVD recovery guarantee is also necessary for computationally efficient recovery in the stated regime. The source does not provide a resolution.
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.