Alexander Razborov | PIMS - Pacific Institute for the Mathematical Sciences

Andew MacLeish Distinguished Service Professor in Computer Science, University of Chicago

Alexander Razborov, Andrew MacLeish Distinguished Service Professor in Computer Science, University of Chicago. Alexander Razborov received his B.Sc in mathematics from Moscow State University and PhD from the Steklov Mathematical Institute (advisor: S. Adian). Currently he is an Andrew MacLeish Distinguished Service Professor at the Department of Computer Science at the University of Chicago, with part-time appointments at Steklov Mathematical Institute and Toyota Technological Institute at Chicago. Dr. Razborov's research interests span several areas in Theoretical Computer Science, including computational complexity, proof complexity, quantum computing and computational complexity, as well as related mathematical areas, notably Discrete Mathematics and Combinatorial Group Theory. He received the Rolf Nevanlinna Prize in 1990, the Godel Prize in 2007 and the David P. Robbins Prize in 2013. Dr. Razborov is a member of the Academia Europea (since 1993) and a corresponding member of the Russian Academy of Sciences (since 2000).

A substantial part of extremal combinatorics studies relations existing between densities with which given combinatorial structures (fixed size ``templates'') may appear in unknown (and presumably very large) structures of the same type. Using basic...