Pages that link to "Item:Q3580954"
From MaRDI portal
The following pages link to Robust pcps of proximity, shorter pcps and applications to coding (Q3580954):
Displaying 9 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Testing algebraic geometric codes (Q1047829) (← 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)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- (Q4638059) (← links)
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455) (← links)