Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
Publication
, Conference
Zhang, A; Luo, Y
Duke Scholars
Volume
125
Start / End Page
3852 / 3856
Conference Name
The Conference on Learning Theory
Citation
APA
Chicago
ICMJE
MLA
NLM
Zhang, A., & Luo, Y. (n.d.). Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection (Vol. 125, pp. 3852–3856). Presented at the The Conference on Learning Theory.
Zhang, Anru, and Yuetian Luo. “Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection,” 125:3852–56, n.d.
Zhang A, Luo Y. Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection. In p. 3852–6.
Zhang, Anru, and Yuetian Luo. Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection. Vol. 125, pp. 3852–56.
Zhang A, Luo Y. Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection. p. 3852–3856.
Volume
125
Start / End Page
3852 / 3856
Conference Name
The Conference on Learning Theory