filmov
tv
The PCP theorem - Irit Dinur
Показать описание
Hermann Weyl Lectures
Topic: The PCP theorem
Speaker: Irit Dinur
Affiliation: Weizmann Institute of Science; Visiting Professor, School of Mathematics
Date: November 18, 2019
Topic: The PCP theorem
Speaker: Irit Dinur
Affiliation: Weizmann Institute of Science; Visiting Professor, School of Mathematics
Date: November 18, 2019
The PCP theorem - Irit Dinur
The PCP theorem, locally testable codes, and property testing - Irit Dinur
Dinur's proof of the PCP Theorem: the Powering step || @ CMU || Lecture 27d of CS Theory Toolki...
Dinur's Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit
Statement of the PCP Theorem || @ CMU || Lecture 27a of CS Theory Toolkit
Dinur's PCP: degree-reduction, expanderizing, mini-PCP || @ CMU || Lecture 27c of CS Theory Too...
Irit Dinur: High dimensional expansion and PCPs
Crash Course on Probabilistically Checkable Proofs (PCP): Parallel Repetition
Subhash Khot: Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem
Lecture B.9: PCP composition and the PCP theorem
METRIC 2011 - Probabilistically Checkable Proofs - Lecture 1 - Irit Dinur
Crash Course on Probabilistically Checkable Proofs (PCP): Introduction
METRIC 2011 - Probabilistically Checkable Proofs - Lecture 2 - Irit Dinur
'P, NP, and Probabilistically Checkable Proofs' by Irit Dinur - MATH+ Friday Colloquium
High Dimensional Expanders and PCPs
Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem
Crash Course on Probabilistically Checkable Proofs (PCP)...
High dimensional expansion and agreement testing - Irit Dinur
What does probabilistically checkable proof mean?
Boaz Barak: Dreams of a PCP theorem
Irit Dinur: On the Structure of NP-Hard 3-SAT Instances
Crash Course on Probabilistically Checkable Proofs (PCP): Optimal Inapproximability Results
Revisiting Alphabet Reduction in Dinur’s PCP
Irit Dinur 'Locally testable codes with constant rate, distance, and locality' | Big Semin...
Комментарии