Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114): Difference between revisions

@@ Property / cites work @@
+A combinatorial characterization of the testable graph properties
+Normal rank
@@ Property / cites work @@
+Testing Reed–Muller Codes
@@ Property / cites work: Testing Reed–Muller Codes / 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 @@
+Locally Testable Codes Require Redundant Testers
@@ Property / cites work: Locally Testable Codes Require Redundant Testers / rank @@
+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 @@
+On Sums of Locally Testable Affine Invariant Properties
+Normal rank
@@ Property / cites work @@
+Simple PCPs with poly-log rate and query complexity
+Normal rank
@@ Property / cites work @@
+Optimal Testing of Reed-Muller Codes
@@ Property / cites work: Optimal Testing of Reed-Muller Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+Graph limits and parameter testing
@@ Property / cites work: Graph limits and parameter testing / rank @@
+Normal rank
@@ Property / cites work @@
+Private information retrieval
@@ Property / cites work: Private information retrieval / 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 @@
+-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Locally testable codes and PCPs of almost-linear length
+Normal rank
@@ Property / cites work @@
+-transitivity is insufficient for local testability
+Normal rank
@@ Property / cites work @@
+Testing low-degree polynomials over prime fields
@@ Property / cites work: Testing low-degree polynomials over prime fields / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on cyclic codes which are invariant under the affine group and their applications
+Normal rank
@@ Property / cites work @@
+On the efficiency of local decoding procedures for error-correcting codes
+Normal rank
@@ Property / cites work @@
+Q3549724
@@ Property / cites work: Q3549724 / 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 @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Q3549650
@@ Property / cites work: Q3549650 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient checking of polynomials and proofs and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Towards 3-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Locally Decodable Codes
@@ Property / cites work: Locally Decodable Codes / rank @@
+Normal rank