Association Schemes, Non-Commutative Polynomials and Lasserre Lower Bounds for Planted Clique

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=XtZnEad92SU


Duration: 52:43
541 views
2

Raghu Meka, Microsoft Research
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/raghu-meka-2013-08-30



Other Videos By Simons Institute for the Theory of Computing


2013-09-10Past, Present and Future of Randomized Numerical Linear Algebra I
2013-09-09Algorithmic High-Dimensional Geometry II
2013-09-09User-Friendly Tools for Random Matrices III
2013-09-09User-Friendly Tools for Random Matrices I
2013-09-09Algorithmic High-Dimensional Geometry I
2013-09-09Big Data: The Computation/Statistics Interface
2013-09-05Testing Surface Area
2013-09-04Generalizations of the KKL Theorem and Friedgut's Junta Theorem
2013-09-04MCMC Learning
2013-09-04Fourier PCA
2013-09-04Association Schemes, Non-Commutative Polynomials and Lasserre Lower Bounds for Planted Clique
2013-09-04Agnostic Learning Over Permutation Invariant Distributions
2013-09-04Local Combinatorics, Or: What To Do With All Those Gigantic Graphs?
2013-09-04Locally Testable Codes and Cayley Graphs
2013-09-04On the Structure of Boolean Functions With Small Spectral Norm
2013-09-04Testing for Affine Invariant Properties of Algebraic Functions
2013-09-04Approximating Boolean Functions With Small-Depth Circuits
2013-09-04Deterministic Counting of Satisfying Assignments for Juntas of Degree-2 PTFs
2013-09-04Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions
2013-09-04Moment-Matching Polynomials
2013-09-04Approximate Constraint Satisfaction Requires Large LP Relaxations


Tags:
Simons Institute
Real Analysis
UC Berkeley
computer science
theory of computing
Raghu Meka