The Algorithms and Complexity Theory Group deals with fundamental issues of computational complexity such as the “P=NP?”
problem, and the design and analysis of classical, randomised, and online algorithms for highly relevant problems in areas
such as constraint satisfaction, algorithmic game theory, computational mathematics, computational biology, formal logic,
verification, quantum computing, database theory, artificial intelligence and others. Given that algorithms and complexity
issues are fundamental to nearly every area of computer science, the Algorithms Group collaborates intensively with many other
groups in the department, investigating concrete problems arising in their respective research.
The group is organised into a number of overlapping research topics:
- CORE ALGORITHMS
- COMPUTATIONAL COMPLEXITY
- CONSTRAINT SATISFACTION
- ALGORITHMIC GAME THEORY
- ALGORITHMS AT LARGE
The group has a regular seminar series.
Oxford Algorithms Day took place on 15 April 2015. Details are available
Related seminar series