Pages that link to "Item:Q5946703"
From MaRDI portal
The following pages link to Small PCPs with low query complexity (Q5946703):
Displaying 13 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Sub-constant error probabilistically checkable proof of almost-linear size (Q626681) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Small PCPs with low query complexity (Q2762515) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Worst-case to average case reductions for the distance to a code (Q5121912) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)