Head: Thapen Neil Dillip

Our department traditionally focuses on logic, algebra, combinatorics and theoretical computer science. Currently the main topics are proof complexity, bounded arithmetic, and computational complexity, complemented with research into finite combinatorics, set theory, geometry and cryptography.