PCPs and Global Hyper-contractivity - Lecture 2
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore advanced concepts in theoretical computer science with this lecture on PCPs (Probabilistically Checkable Proofs) and Global Hyper-contractivity. Delivered by Dor Minzer from the Massachusetts Institute of Technology as part of the Analysis and TCS Boot Camp, delve into the second part of this complex topic. Gain insights into the intersection of probabilistic proof systems and hypercontractive inequalities, and their applications in computational complexity theory. Suitable for graduate students and researchers in computer science and mathematics seeking to deepen their understanding of cutting-edge developments in proof systems and complexity theory.
Syllabus
PCPs and Global Hyper-contractivity 2
Taught by
Simons Institute
Related Courses
Approximation Algorithms Part IÉcole normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Delivery Problem
University of California, San Diego via Coursera