The following pages link to (Q5302098):
Displayed 4 items.
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)