A combinatorial characterization of smooth LTCs and applications (Q2820271): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.20637
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.20637 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2288415650
@@ Property / OpenAlex ID: W2288415650 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Languages are Testable with a Constant Number of Queries
+Normal rank
@@ Property / cites work @@
+Lower bounds on space complexity for contextfree recognition
+Normal rank
@@ Property / cites work @@
+A lower bound for the nondeterministic space complexity of context-free recognition
+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 @@
+Linearity testing in characteristic two
@@ Property / cites work: Linearity testing in characteristic two / rank @@
+Normal rank
@@ Property / cites work @@
+Limitation on the Rate of Families of Locally Testable Codes
+Normal rank
@@ Property / cites work @@
+Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
+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 @@
+Simple PCPs with poly-log rate and query complexity
+Normal rank
@@ Property / cites work @@
+Robust locally testable codes and products of codes
+Normal rank
@@ Property / cites work @@
+Q3002812
@@ Property / cites work: Q3002812 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+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 @@
+Locally testable codes and PCPs of almost-linear length
+Normal rank
@@ Property / cites work @@
+Some Results on Tape-Bounded Turing Machines
@@ Property / cites work: Some Results on Tape-Bounded Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
+Normal rank
@@ Property / cites work @@
+New Extension of the Weil Bound for Character Sums with Applications to Coding
+Normal rank
@@ Property / cites work @@
+Q3549724
@@ Property / cites work: Q3549724 / rank @@
+Normal rank
@@ Property / cites work @@
+Space complexity vs. query complexity
@@ Property / cites work: Space complexity vs. query complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Log Space Recognition and Translation of Parenthesis Languages
+Normal rank
@@ Property / cites work @@
+Bracket-languages are recognizable in logarithmic space
+Normal rank
@@ Property / cites work @@
+Combinatorial Construction of Locally Testable Codes
+Normal rank
@@ Property / cites work @@
+Testing Membership in Languages that Have Small Width Branching Programs
+Normal rank
@@ Property / cites work @@
+Language recognition by marking automata
@@ Property / cites work: Language recognition by marking automata / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+A recursive approach to low complexity codes
@@ Property / cites work: A recursive approach to low complexity codes / rank @@
+Normal rank