Pages that link to "Item:Q3546312"
From MaRDI portal
The following pages link to Locally testable codes and PCPs of almost-linear length (Q3546312):
Displayed 21 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- On the rectangle method in proofs of robustness of tensor products (Q437691) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Quantum Locally Testable Codes (Q3449558) (← links)
- Tensor Products of Weakly Smooth Codes Are Robust (Q3541803) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)