Skip to main content
Avi Wigderson
Personal
CV
Short CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Sum-of-squares lower bounds for planted clique
Submitted by
dloring
on Mon, 2015-03-23 00:00
Author:
R. Meka
A. Potechin
A. Wigderson
Publication:
Proceedings of the Symposium on Theory of Computing (STOC) 2015, pp. 87-96, 2015.
Year:
2015
Files
File:
Journal version (pdf)
‹ Sum-of-Squares Lower Bounds for Sparse PCA
up
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity ›