Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
Machine Learning
2020-09-15 v1 Computational Complexity
Machine Learning
Combinatorics
Abstract
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.
Cite
@article{arxiv.2009.05870,
title = {Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection},
author = {Yuetian Luo and Anru R. Zhang},
journal= {arXiv preprint arXiv:2009.05870},
year = {2020}
}
Comments
Published at Proceedings of Conference on Learning Theory, 2020