Rahul Santhanam

Rahul Santhanam is Professor of Computing Science and Tutorial Fellow at Magdalen College, University of Oxford. His research focuses on computational complexity, algorithms, and bounded rationality, with expertise in circuit complexity and proof systems.

Education includes:

• Ph.D. in Computer Science from University of Chicago

Research interests span theoretical computer science with emphasis on complexity class separations, circuit lower bounds, and satisfiability algorithms. His work establishes connections between different areas of complexity theory.

Publications address fundamental questions in computational complexity, including hardness magnification, circuit lower bounds, and the complexity of satisfiability problems. Recent work explores frontiers of provable intractability.

He has mentored multiple PhD students and serves on program committees for major theoretical computer science conferences.