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
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera