PCPs and Global Hyper-contractivity - Lecture 2

Offered By: Simons Institute via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

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

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam