[Logic and Complexity] Derandomization

Yijia Chen yijia.chen at cs.sjtu.edu.cn
Thu Nov 8 14:05:45 CST 2012


 Hi,

 As promised, I will start a small series of informal
 talks on derandomization. The goal is to present a
 complete proof (with no stone unturned) on the
 result that assuming there is a function in E without
 subexponential size circuit, then BPP= P.

 The first talk is planned on Sunday morning around
 10:00am, again strictly one hour, after which we might
 play basketball in the afternoon.

 Please don't distribute, thanks!


 Yijia


More information about the Logic mailing list