Crash Course on Probabilistically Checkable Proofs (PCP): Optimal Inapproximability Results

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


Duration: 1:17:07
838 views
24

Dana Moshkovitz, University of Texas at Austin
https://simons.berkeley.edu/talks/tbd-163
Probability, Geometry, and Computation in High Dimensions Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2020-08-28Statistical Physics and Computation in High Dimension
2020-08-27Recent Progress in High-Dimensional Learning
2020-08-26Sketching High-Dimensional Data
2020-08-26Recent Progress in High-Dimensional Learning
2020-08-26Statistical Physics and Computation in High Dimension
2020-08-25Sketching High-Dimensional Data
2020-08-25Recent Progress in High-Dimensional Learning
2020-08-25Statistical Physics and Computation in High Dimension
2020-08-25Sketching High-Dimensional Data
2020-08-24Remarks on the Discrete Cube
2020-08-24Crash Course on Probabilistically Checkable Proofs (PCP): Optimal Inapproximability Results
2020-08-21Sketching High-Dimensional Data
2020-08-21Remarks on the Discrete Cube
2020-08-21Crash Course on Probabilistically Checkable Proofs (PCP): Parallel Repetition
2020-08-20Remarks on the Discrete Cube
2020-08-20Crash Course on Probabilistically Checkable Proofs (PCP)...
2020-08-19Remarks on the Discrete Cube
2020-08-19Advances in Boolean Function Analysis — Pseudorandom Generators from Polarizing Random Walks - 2
2020-08-19Advances in Boolean Function Analysis — Pseudorandom Generators from Polarizing Random Walks
2020-08-19Crash Course on Probabilistically Checkable Proofs (PCP): Introduction
2020-08-12KKL via Random Restrictions


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Probability; Geometry; and Computation in High Dimensions Boot Camp
Dana Moshkovitz