Pages that link to "Item:Q2817611"
From MaRDI portal
The following pages link to Nearly-linear size holographic proofs (Q2817611):
Displaying 31 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- A novel elementary construction of matching vectors (Q436582) (← links)
- On the rectangle method in proofs of robustness of tensor products (Q437691) (← links)
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- Local reduction (Q1641001) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← 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)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Local Reductions (Q3448833) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Many-valued logics and holographic proofs (Q4938652) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- On axis-parallel tests for tensor product codes (Q5002642) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- (Q5090443) (← links)
- Worst-case to average case reductions for the distance to a code (Q5121912) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
