YoVDO

PCPs and Global Hyper-contractivity - Lecture 1

Offered By: Simons Institute via YouTube

Tags

Probabilistically Checkable Proofs Courses Theoretical Computer Science Courses Error-Correcting Codes Courses Fourier Analysis Courses Computational Complexity Theory Courses Approximation Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricate relationship between Probabilistically Checkable Proofs (PCPs) and Global Hyper-contractivity in this 50-minute lecture delivered by Dor Minzer from the Massachusetts Institute of Technology. Delve into advanced concepts in theoretical computer science and analysis as part of the Analysis and TCS Boot Camp series hosted by the Simons Institute. Gain insights into the fundamental principles and applications of these complex topics, enhancing your understanding of cutting-edge research in computational complexity theory.

Syllabus

PCPs and Global Hyper-contractivity 1


Taught by

Simons Institute

Related Courses

Automata Theory
Stanford 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