Skip to main content
Avi Wigderson
Personal
Short Bio
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
»
Talks
Sum-of-squares lower bounds for the planted clique problem
Submitted by
sgriffin
on Thu, 2020-03-19 12:54
Description:
November 25, 2014 (continued in "More on sum-of-squares proofs for planted clique")
File:
Video
Date:
2014-11-25
‹ Structure in TCS
up
Technion Honorary Doctorate, 2023 ›