Inapproximability of Constraint Satisfaction Problems V

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


Duration: 1:16:44
439 views
20

Johan Håstad, KTH Royal Institute of Technology
Real Analysis Boot Camp
http://simons.berkeley.edu/talks/johan-hastad-2013-09-13



Other Videos By Simons Institute for the Theory of Computing


2013-09-27Sampling for Subset Selection and Applications
2013-09-27Nimble Algorithms for Cloud Computing
2013-09-27How Robust are Linear Sketches to Adaptive Inputs?
2013-09-27Power to the Points: Local Certificates for Clusterings
2013-09-27Homomorphic Sketches: Shrinking Big Data without Sacrificing Structure
2013-09-27Simple and Deterministic Matrix Sketches
2013-09-27Randomized Numerical Linear Algebra
2013-09-27Something for Almost Nothing: Advances in Sub-Linear Time Algorithms
2013-09-27Input-sparsity Time Algorithms for Embeddings and Regression Problems
2013-09-24Introduction to Analysis on the Discrete Cube IV
2013-09-24Inapproximability of Constraint Satisfaction Problems V
2013-09-24Inapproximability of Constraint Satisfaction Problems IV
2013-09-24Introduction to Analysis on the Discrete Cube III
2013-09-20Optimizing with Tensors
2013-09-17Analytic Methods for Supervised Learning IV
2013-09-17Inapproximability of Constraint Satisfaction Problems III
2013-09-11Inapproximability of Constraint Satisfaction Problems II
2013-09-11Analytic Methods for Supervised Learning III
2013-09-11Introduction to Analysis on the Discrete Cube II
2013-09-11Analytic Methods for Supervised Learning II
2013-09-11Inapproximability of Constraint Satisfaction Problems I


Tags:
Simons Institute
Real Analysis
UC Berkeley
computer science
theory of computing
Johan Håstad
Johan Hastad