The following pages link to (Q5121889):
Displaying 11 items.
- A random-walk pseudorandom byte generator (Q1591115) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Pseudorandom generators for low sensitivity functions (Q4993293) (← links)
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates (Q5090395) (← links)
- (Q5091189) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Pseudorandom generators from polarizing random walks (Q5204828) (← links)
- (Q5875501) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)