Pages that link to "Item:Q1881217"
From MaRDI portal
The following pages link to Fast approximate probabilistically checkable proofs (Q1881217):
Displayed 16 items.
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← 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)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Arguments of Proximity (Q3457077) (← 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)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5121910) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)