Derandomized parallel repetition via structured PCPs
From MaRDI portal
(Redirected from Publication:645129)
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 1263222 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 5485571 (Why is no real title available?)
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
- A Parallel Repetition Theorem
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Clustering in the Boolean hypercube in a list decoding regime
- Combinatorial PCPs with Efficient Verifiers
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs
- Derandomized parallel repetition via structured PCPs
- Efficient probabilistically checkable proofs and applications to approximations
- Improved low-degree testing and its applications
- Interactive proofs and the hardness of approximating cliques
- Nearly-linear size holographic proofs
- New direct-product testers and 2-query PCPs
- Optimization, approximation, and complexity classes
- PCP characterizations of NP: toward a polynomially-small error-probability
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Ramanujan graphs
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- Sound 3-Query PCPPs Are Long
- Sub-Constant Error Low Degree Test of Almost-Linear Size
- The PCP theorem by gap amplification
Cited in
(12)- New direct-product testers and 2-query PCPs
- Combinatorial PCPs with short proofs
- Parallel Repetition of Computationally Sound Protocols Revisited
- Derandomized parallel repetition via structured PCPs
- Composition of low-error 2-query PCPs using decodable PCPs
- New direct-product testers and 2-query PCPs
- Composition of low-error 2-query PCPs using decodable PCPs
- Direct sum testing
- Combinatorial PCPs with efficient verifiers
- Coboundary and cosystolic expansion without dependence on dimension or degree
- On parallel repetition of PCPs
- Short PCPs with projection queries
This page was built for publication: Derandomized parallel repetition via structured PCPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645129)
