Pages that link to "Item:Q623502"
From MaRDI portal
The following pages link to On the randomness complexity of property testing (Q623502):
Displaying 7 items.
- Non-interactive proofs of proximity (Q1745962) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
