Impagliazzos Worlds in Arithmetic Complexity: A Progress Report Scott Aaronson and Andrew Drucker MIT 100% QUANTUM-FREE TALK (FROM COWS NOT TREATED WITH.
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
How to Fool People to Work on Circuit Lower Bounds Ran Raz Weizmann Institute & Microsoft Research.
