mlsanityData to 14 Oct 2026

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

arXiv 2009.05870 ↗First posted 12 Sep 2020stat.ML cs.CC cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 7; 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

10 papers.