Pages that link to "Item:Q1745962"
From MaRDI portal
The following pages link to Non-interactive proofs of proximity (Q1745962):
Displaying 9 items.
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5857610) (← links)
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
