Probabilistically Checkable Proofs (Part I)

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=nJdCDECzG5s


Duration: 58:30
1,426 views
27

Prahladh Harsha (Tata Institute of Fundamental Research)
https://simons.berkeley.edu/talks/probabilistically-checkable-proofs-part-i
Proofs, Consensus, and Decentralizing Society Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2019-08-29Attacks, Incentives, and Game-theoretic Analysis (Part I)
2019-08-28Nakamoto’s Consensus: Foundations of Blockchain Security (Part II)
2019-08-28Consensus: A Quintessential Computer Science Problem (Part I)
2019-08-28Consensus: A Quintessential Computer Science Problem (Part II)
2019-08-28Nakamoto’s Consensus: Foundations of Blockchain Security (Part I)
2019-08-27Zero Knowledge from the Discrete Logarithm Problem
2019-08-27Zero Knowledge from Multi-Party Computation
2019-08-27Succinct Arguments (Part II)
2019-08-27Succinct Arguments (Part I)
2019-08-26Probabilistically Checkable Proofs (Part II)
2019-08-26Probabilistically Checkable Proofs (Part I)
2019-08-26Interactive Proofs (Part II)
2019-08-26Interactive Proofs (Part I)
2019-08-08Designing Robust Learners
2019-08-08Better Learning from the Past: Counterfactual / Batch RL
2019-08-08Inherent Trade-offs with the Local Explanations Paradigm
2019-08-08How to Fail Interpretability Research
2019-08-07The Measure and Mismeasure of Fairness
2019-08-07Integrating Constraints into Deep Learning Architectures with Structured Layers
2019-08-07Towards Verified Deep Learning
2019-08-07Reinforcement Learning via an Optimization Lens


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Prahladh Harsha
Proofs Consensus and Decentralizing Society Boot Camp