Generate a tailored SOP for Dr. Anuj Dawar. Improve your application with a focused, well-structured draft.
Professor Anuj Dawar works in the broad area of theoretical computer science. He is particularly interested in the investigation of computational complexity through the lens of logic, with a focus on descriptive complexity and the characterization of complexity problems. His recent research has led to a fascinating exploration of the limits of symmetric algorithms, establishing a robust notion of symmetric complexity that relates to logic, circuits, and linear optimization methods. His research methods are rooted in finite model theory and encompass a variety of techniques aimed at studying the expressive power of formal logic structures, graphs, relational databases, and program models. The connection between descriptive complexity and its applications is a central theme of his work, specifically in database theory, verification, and the analysis of games.
University of Cambridge • Cambridge, GB
Professor of Logic and Algorithms, conducting research and teaching in areas of theoretical computer science.
Standard postgraduate requirements for Department of Politics and International Studies (POLIS) and related humanities departments.