Pages that link to "Item:Q3448824"
From MaRDI portal
The following pages link to Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824):
Displaying 10 items.
- Non-interactive proofs of proximity (Q1745962) (← 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)
- Delegating RAM Computations (Q3181023) (← 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)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5121910) (← links)
