Abstract

I will discuss the recent proof that the complexity class NEXP (nondeterministic exponential time) lacks nonuniform ACC circuits of polynomial size. The proof will be described from the perspective of someone trying to discover it. 1 c ©R. R. Williams, 2011. Computer Science Department, Stanford University, Stanford, CA, USA. rrwilliams@gmail.com. At the time of writing, the author was supported by the Josef Raviv Memorial Fellowship at IBM Research – Almaden.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call