DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» PCP theorem
PCP theorem
Ab Pcpchap.Pdf
Lecture 19,20 (Nov 15&17, 2011): Hardness of Approximation, PCP
Pointer Quantum Pcps and Multi-Prover Games
Probabilistic Proof Systems: a Primer
Lecture 19: Interactive Proofs and the PCP Theorem
QMA with Subset State Witnesses
Notes for Lecture 1 1 a Brief Historical Overview
Revisiting Alphabet Reduction in Dinur's
Lecture 9: Dinur's Proof of the PCP Theorem 9.1 Hardness Of
PCP and Hardness of Approximation
Lecture 25: Sketch of the PCP Theorem 1 Overview 2
The PCP Theorem by Gap Amplification
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States
Polynomially Low Error Pcps with Polyloglog N Queries Via Modular Composition∗
Probabilistically Checkable Proofs: a Primer
Download Computational Complexity: a Modern Approach Free Ebook
Lower Bounds on Approximation Lecture 22 We Can Now Divide the Approximation Problems We've Seen Into a Number of Categories
Dinur's Proof of the PCP Theorem
Top View
PCP & Hardness of Approximation
Lecture 18 1 History Of
(Prasad Raghavendra) 1 Overview 2 the PCP Theorem
Lecture 21 1 Probabilistically Checkable Proofs
Lecture 10: Hardness of Approximating Clique, FGLSS Graph Nov
Notes on PCP and Inapproximability
Constant-Soundness Interactive Proofs for Local Hamiltonians
Probabilistically Checkable Proofs and Hardness of Approximation
On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner 107
Probabilistically Checkable Proofs
Probabilistically Checkable Proofs and Codes
Interactive Oracle Proofs with Constant Rate and Query Complexity
Probabilistically Checkable Proofs
Lecture 1: the PCP Theorem – Introduction and Two Views 1.1 Hardness of Approximation
Product-State Approximations to Quantum Ground States
Probabilistically Checkable Proofs (PCP)
Fourier Analysis and Inapproximability for MAX-CUT: a Case Study
Quantum Proofs, the Local Hamiltonian Problem and Applications Alex Bredariol Grilo