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

09/12/2020
by   Yuetian Luo, et al.
0

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 FULL TEXT

page 1

page 2

page 3

page 4

05/21/2020

Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits

This paper studies the statistical and computational limits of high-orde...
05/16/2020

Reducibility and Statistical-Computational Gaps from Secret Leakage

Inference problems with conjectured statistical-computational gaps are u...
03/30/2019

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

We review NP-hardness framework and PSPACE-hardness framework for a type...
08/28/2020

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...
07/25/2021

Logspace Reducibility From Secret Leakage Planted Clique

The planted clique problem is well-studied in the context of observing, ...
04/05/2022

Almost-Linear Planted Cliques Elude the Metropolis Process

A seminal work of Jerrum (1992) showed that large cliques elude the Metr...
10/17/2020

The role of interactive super-computing in using HPC for urgent decision making

Technological advances are creating exciting new opportunities that have...