Pages that link to "Item:Q4638092"
From MaRDI portal
The following pages link to A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092):
Displaying 10 items.
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Optimal Proximity Proofs Revisited (Q2794513) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5121910) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions (Q6660291) (← links)