Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection

12 Sep 2020  ·  Yuetian Luo, Anru R. Zhang ·

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. read more

PDF Abstract
No code implementations yet. Submit your code now



  Add Datasets introduced or used in this paper

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.


No methods listed for this paper. Add relevant methods here