| Title: |
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Boaz Barak |
-
Harvard University, John A. Paulson School of Engineering and Applied Sciences
|
| Samuel B. Hopkins |
-
Cornell University, Department of Computer Science
|
| Jonathan A. Kelner |
-
Massachusetts Institute of Technology, Department of Mathematics
|
| Pravesh Kothari |
-
University of Texas at Austin, Department of Computer Science
|
| Ankur Moitra |
-
Massachusetts Institute of Technology, Department of Mathematics
|
| Aaron Potechin |
-
Cornell University, Department of Computer Science
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1144153,
1408673,
1350196,
1111109,
1453261
|
| DBLP Key: |
conf/focs/BarakHKKMP16
|
| Author Comments: |
|