Computer Science and Discrete Mathematics
Avi Wigderson is a widely recognized authority in the diverse and evolving field of 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 mathematical creativity be efficiently automated?) Can every efficient process be efficiently reversed? (Is electronic commerce secure?) Can randomness enhance efficient computation? Can quantum mechanics enhance efficient computation? How do we learn, and can machines be taught to learn like us (or better)?