Pages that link to "Item:Q2988902"
From MaRDI portal
The following pages link to Partial tests, universal tests and decomposability (Q2988902):
Displaying 11 items.
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5121910) (← links)
- A characterization of constant‐sample testable properties (Q5236924) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)