Pages that link to "Item:Q5486320"
From MaRDI portal
The following pages link to Robust locally testable codes and products of codes (Q5486320):
Displaying 21 items.
- Combinatorial PCPs with short proofs (Q260390) (← 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)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← 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)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- (Q5002642) (← links)
- (Q5009557) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5093398) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- (Q5875528) (← links)
- Single-shot decoding of good quantum LDPC codes (Q6121809) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
