Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
arXiv:2009.05870v116 citations
Originality Synthesis-oriented
AI Analysis
This work is incremental, as it poses a conjecture without new results, aiming to guide future research on tensor problems.
The paper addresses the open problem of establishing average-case computational hardness for hypergraphic planted clique detection, conjecturing its equivalence to the hardness of standard planted clique detection.
We note the significance of hypergraphic planted clique (HPC) detection in the investigation of computational hardness for a range of tensor problems. We ask if more evidence for the computational hardness of HPC detection can be developed. In particular, we conjecture if it is possible to establish the equivalence of the computational hardness between HPC and PC detection.