2000 character limit reached
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
Published 12 Sep 2020 in stat.ML, cs.CC, cs.LG, and math.CO | (2009.05870v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.