The following pages link to (Q4788614):
Displaying 6 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Low-depth witnesses are easy to find (Q445240) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- On optimal language compression for sets in PSPACE/poly (Q2354585) (← links)
- On the Optimal Compression of Sets in PSPACE (Q3088270) (← links)
