Pages that link to "Item:Q4234094"
From MaRDI portal
The following pages link to Impossibility results for recycling random bits in two-prover proof systems (Q4234094):
Displaying 6 items.
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- (Q2757259) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)