Combinatorial PCPs with efficient verifiers (Q483706): Difference between revisions

@@ Property / DOI @@
-.1007/s00037-014-0080-5
@@ Property / DOI: 10.1007/s00037-014-0080-5 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00037-014-0080-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2061595984
@@ Property / OpenAlex ID: W2061595984 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Universal Arguments and their Applications
@@ Property / cites work: Universal Arguments and their Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
+Normal rank
@@ Property / cites work @@
+Short PCPs with Polylog Query Complexity
@@ Property / cites work: Short PCPs with Polylog Query Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4313087
@@ Property / cites work: Q4313087 / rank @@
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomized parallel repetition via structured PCPs
+Normal rank
@@ Property / cites work @@
+Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
+Normal rank
@@ Property / cites work @@
+Q3826533
@@ Property / cites work: Q3826533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial PCPs with Efficient Verifiers
@@ Property / cites work: Combinatorial PCPs with Efficient Verifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial PCPs with efficient verifiers
@@ Property / cites work: Combinatorial PCPs with efficient verifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly-linear size holographic proofs
@@ Property / cites work: Nearly-linear size holographic proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time encodable and decodable error-correcting codes
+Normal rank
@@ Property / cites work @@
+Q4938652
@@ Property / cites work: Q4938652 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00037-014-0080-5
@@ Property / DOI: 10.1007/S00037-014-0080-5 / rank @@
+Normal rank