The power and weakness of randomness (when you are short on time)

Speaker: Avi Wigderson

Date: Fri, Mar 8, 2013

Location: Department of Mathematics, UBC

Conference: PIMS/UBC Distinguished Colloquium

Subject: Mathematics, Number Theory

Class: Scientific


Avi Wigderson is a widely recognized authority in theoretical computer science. His main research area is computational complexity theory. This field studies the power and limits of efficient computation and is motivated by such fundamental scientific problems as: Does P=NP? Can every efficient process be efficiently reversed? Can randomness enhance efficient computation? Can quantum mechanics enhance efficient computation? He has received, among other awards, both the Nevanlinna Prize and the Gödel Prize.