b. 1956
Ketan Mulmuley is an Indian-American theoretical computer scientist at the University of Chicago, best known for developing Geometric Complexity Theory (GCT), an ambitious program that applies algebraic geometry and representation theory to attack the P vs NP problem. His work bridges computational complexity, algebraic geometry, and representation theory, and has raised philosophical questions about the nature of mathematical and logical knowledge.
Founded Geometric Complexity Theory (GCT) as an approach to P vs NP
Developed algebraic-geometric techniques for lower bounds in computational complexity
Authored foundational papers on GCT with Milind Sohoni
Contributed to parallel algorithms and computational geometry
Professor of Computer Science at the University of Chicago