论文标题
开放问题：超高植物集团检测的平均案例硬度
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
论文作者
论文摘要
我们注意到，在一系列张量问题的计算硬度研究中，超图植物集团（HPC）检测的重要性。我们询问是否可以开发更多有关HPC检测的计算硬度的证据。特别是，我们猜想是否可以建立HPC和PC检测之间的计算硬度的等效性。
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.
