Alexander Razborov

Alexander Razborov is the Andrew McLeish Distinguished Service Professor at the University of Chicago's Department of Mathematics. He holds a B.S. from Moscow State University (1985) and a PhD (1987) and Doctoral Degree (1991) from the Steklov Mathematical Institute. His research spans logic, theoretical computer science (TCS), and combinatorics, with major contributions to proof complexity, continuous combinatorics (flag algebras), and quantum computing.

Notable achievements include the Nevanlinna Prize (1990), Gödel Prize (for foundational work on 'Natural Proofs'), and election to the American Academy of Arts and Sciences (2020). His work on flag algebras revolutionized extremal combinatorics, while his research on proof complexity established fundamental limits of propositional reasoning systems.

Razborov's recent focus includes continuous combinatorics (studying infinite graph limits) and refining proof complexity trade-offs. His collaborative projects with Leonardo Coregliano and others explore topics like Sidorenko's conjecture and neural network convergence guarantees. He is affiliated with the university's computational theory group and actively publishes across top journals like the Annals of Mathematics and Journal of the ACM.