Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015): Difference between revisions

@@ Property / cites work @@
+Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
+Normal rank
@@ Property / cites work @@
+Some 3CNF properties are hard to test
@@ Property / cites work: Some 3CNF properties are hard to test / rank @@
+Normal rank
@@ Property / cites work @@
+Simple PCPs with poly-log rate and query complexity
+Normal rank
@@ Property / cites work @@
+Distribution Testing Lower Bounds via Reductions from Communication Complexity
+Normal rank
@@ Property / cites work @@
+Proofs of Proximity for Distribution Testing
@@ Property / cites work: Proofs of Proximity for Distribution Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
+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 @@
+Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
+Normal rank
@@ Property / cites work @@
+Fast approximate probabilistically checkable proofs
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4578332
@@ Property / cites work: Q4578332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4601820
@@ Property / cites work: Q4601820 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
+Normal rank
@@ Property / cites work @@
+Locally testable codes and PCPs of almost-linear length
+Normal rank
@@ Property / cites work @@
+An Exponential Separation Between MA and AM Proofs of Proximity
+Normal rank
@@ Property / cites work @@
+Q5857610
@@ Property / cites work: Q5857610 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Interactive Proofs of Proximity
@@ Property / cites work: Non-Interactive Proofs of Proximity / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy Theorem for Interactive Proofs of Proximity
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Property Testing of Massively Parametrized Problems – A Survey
+Normal rank
@@ Property / cites work @@
+Constant-round interactive proofs for delegating computation
+Normal rank
@@ Property / cites work @@
+Interactive proofs of proximity
@@ Property / cites work: Interactive proofs of proximity / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Time-Optimal Interactive Proofs for Circuit Evaluation
+Normal rank