YoVDO

PCPs and Global Hyper-contractivity - Lecture 3

Offered By: Simons Institute via YouTube

Tags

Probabilistically Checkable Proofs Courses Algorithms Courses Theoretical Computer Science Courses Computational Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore advanced concepts in Probabilistically Checkable Proofs (PCPs) and Global Hyper-contractivity in this hour-long lecture by Dor Minzer from the Massachusetts Institute of Technology. Delve into the third installment of the series, presented as part of the Analysis and Theoretical Computer Science Boot Camp at the Simons Institute. Gain insights into cutting-edge research and theoretical developments in computational complexity theory and its applications.

Syllabus

PCPs and Global Hyper-contractivity 3


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