Combinatorial PCPs with efficient verifiers
From MaRDI portal
Recommendations
Cites work
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Combinatorial PCPs with efficient verifiers
- Combinatorial PCPs with Efficient Verifiers
- Derandomized parallel repetition via structured PCPs
- scientific article; zbMATH DE number 4101157 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 1405671 (Why is no real title available?)
- Linear-time encodable and decodable error-correcting codes
- Nearly-linear size holographic proofs
- Non-deterministic exponential time has two-prover interactive protocols
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Short PCPs with Polylog Query Complexity
- The PCP theorem by gap amplification
- Universal Arguments and their Applications
Cited in
(10)- Combinatorial PCPs with short proofs
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
- Combinatorial PCPs with efficient verifiers
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
- Erasures vs. errors in local decoding and property testing
- Abstract Combinatorial Programs and Efficient Property Testers
- On the Complexity of Verifying Regular Properties on Flat Counter Systems,
- Erasures versus errors in local decoding and property testing
- Zero-knowledge IOPs approaching witness length
- Local proofs approaching the witness length
This page was built for publication: Combinatorial PCPs with efficient verifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483706)
