Crash Course on Probabilistically Checkable Proofs - PCP
Offered By: Simons Institute via YouTube
Course Description
Overview
Dive into a comprehensive lecture on Probabilistically Checkable Proofs (PCP) delivered by Dana Moshkovitz from the University of Texas at Austin. Explore the PCP Theorem, global properties, and the formulation of PCP in P language. Examine the differences between global and local tests, and delve into computational problems. Learn about simple and complex constructions, linear functions, variables, and equations related to PCP. This 78-minute talk, part of the Probability, Geometry, and Computation in High Dimensions Boot Camp at the Simons Institute, provides a thorough crash course on this important topic in computational complexity theory.
Syllabus
Introduction
PCP Theorem
Global Properties
Can PCP be formulated in P language
Global vs Local Tests
Computational Problem
Simple Construction
Construction
Linear Functions
Variables
Equations
Conclusion
Proof
Taught by
Simons Institute
Related Courses
Design of Computer ProgramsStanford University via Udacity Intro to Statistics
Stanford University via Udacity Health in Numbers: Quantitative Methods in Clinical & Public Health Research
Harvard University via edX Mathematical Biostatistics Boot Camp 1
Johns Hopkins University via Coursera Statistics
San Jose State University via Udacity