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

by   Yuetian Luo, et al.

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.


page 1

page 2

page 3

page 4


Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits

This paper studies the statistical and computational limits of high-orde...

Reducibility and Statistical-Computational Gaps from Secret Leakage

Inference problems with conjectured statistical-computational gaps are u...

A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi

We review NP-hardness framework and PSPACE-hardness framework for a type...

Is the space complexity of planted clique recovery the same as that of detection?

We study the planted clique problem in which a clique of size k is plant...

Logspace Reducibility From Secret Leakage Planted Clique

The planted clique problem is well-studied in the context of observing, ...

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries

This paper develops several average-case reduction techniques to show ne...

The Complexity of Cluster Vertex Splitting and Company

Clustering a graph when the clusters can overlap can be seen from three ...

Please sign up or login with your details

Forgot password? Click here to reset