CMI Seminar: Dean Doron - *3pm start time*

Tuesday November 5, 2019 3:00 PM

Nearly Optimal Pseudorandomness From Hardness

Speaker: Dean Doron, Stanford
Location: Annenberg 314

Existing proofs that deduce P=BPP from circuit lower bounds convert randomized algorithms to deterministic ones with a large polynomial slowdown in running time. In this talk, I will show that if we assume exponential lower bounds against nondeterministic circuits, we can convert any randomized algorithm running in time T to a deterministic one running in time T^{2+α} for an arbitrarily small constant α. Under complexity-theoretic assumptions, such a slowdown is nearly optimal.

Our result follows from a new pseudorandom generator whose construction uses, among other ideas, a new connection between pseudoentropy generators and locally list-recoverable codes.

Joint work with Dana Moshkovitz, Justin Oh and David Zuckerman

Series Center for the Mathematics of Information (CMI) Seminar Series

Contact: Linda Taddeo at 626-395-6704
For more information visit: