Combinatorial PCPs with efficient verifiers
type: Item
instance of: scholarly article
title: Combinatorial PCPs with efficient verifiers
zbMATH Open document ID: 1318.68087
author: Or Meir
published in: Computational Complexity
publication date: 2014-12-17T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6381311
zbMATH Keywords: probabilistically checkable proofs
zbMATH Keywords: PCP of proximity
zbMATH Keywords: combinatorial PCP
MaRDI profile type: Publication
full work available at URL: s00037-014-0080-5
OpenAlex ID: W2061595984
cites work: Proof verification and the hardness of approximation problems
cites work: Probabilistic checking of proofs
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Universal Arguments and their Applications
cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
cites work: Short PCPs with Polylog Query Complexity
cites work: Q4313087
cites work: The PCP theorem by gap amplification
cites work: Derandomized parallel repetition via structured PCPs
cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
cites work: Q3826533
cites work: Q4002466
cites work: Combinatorial PCPs with Efficient Verifiers
cites work: Nearly-linear size holographic proofs
cites work: Linear-time encodable and decodable error-correcting codes
cites work: Q4938652
DOI: 10.1007/S00037-014-0080-5
description: scientific article; zbMATH DE number 6381311