Explore advanced concepts in Probabilistically Checkable Proofs (PCPs) and Global Hyper-contractivity in this hour-long lecture by Dor Minzer from the Massachusetts Institute of Technology. Delve into the third installment of the series, presented as part of the Analysis and Theoretical Computer Science Boot Camp at the Simons Institute. Gain insights into cutting-edge research and theoretical developments in computational complexity theory and its applications.
PCPs and Global Hyper-contractivity - Lecture 3
Overview
Syllabus
PCPs and Global Hyper-contractivity 3
Taught by
Simons Institute
Related Courses
-
PCPs and Global Hyper-contractivity - Lecture 1
-
PCPs and Global Hyper-contractivity - Lecture 1
-
PCPs and Global Hyper-contractivity - Lecture 2
-
Hyper-contractivity in Analysis and Theoretical Computer Science - Introduction 3
-
Quasi-Linear Size PCPs with Small Soundness from High-Dimensional Expanders
-
Probabilistically Checkable Proofs - Part I
