Explore the intricate relationship between Probabilistically Checkable Proofs (PCPs) and Global Hyper-contractivity in this advanced lecture by Dor Minzer from the Massachusetts Institute of Technology. Delve into the theoretical foundations and practical implications of these concepts as part of the Analysis and Theoretical Computer Science Boot Camp. Gain insights into cutting-edge research in computational complexity theory and its applications in modern computer science.
PCPs and Global Hyper-contractivity - Lecture 1
Overview
Syllabus
PCPs and Global Hyper-contractivity 1
Taught by
Simons Institute
Related Courses
-
PCPs and Global Hyper-contractivity - Lecture 1
-
PCPs and Global Hyper-contractivity - Lecture 3
-
PCPs and Global Hyper-contractivity - Lecture 2
-
Hyper-contractivity in Analysis and Theoretical Computer Science - Introduction 3
-
Local Proofs Approaching the Witness Length
-
Probabilistically Checkable Proofs - Part I
