Pages that link to "Item:Q2170038"
From MaRDI portal
The following pages link to A PCP theorem for interactive proofs and applications (Q2170038):
Displaying 5 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (Q3580955) (← links)
- (Q4341733) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)