Pages that link to "Item:Q3546312"
From MaRDI portal
The following pages link to Locally testable codes and PCPs of almost-linear length (Q3546312):
Displaying 50 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)
- Symmetric LDPC codes and local testing (Q519972) (← 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)
- Good cyclic codes and the uncertainty principle (Q1624913) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Bounds on locally testable codes with unique tests (Q2826056) (← 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)
- Locally Testable Cyclic Codes (Q3546520) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound (Q4575883) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- On axis-parallel tests for tensor product codes (Q5002642) (← links)
- Explicit strong LTCs with inverse poly-log rate and constant soundness (Q5009557) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- On axis-parallel tests for tensor product codes (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455) (← links)
- (Q5857610) (← links)
