Skip to main content

Algorithms and Complexity Theory

Research in Algorithms and Complexity Theory includes determining the inherent difficulty of computational problems, classifying problems according to this inherent difficulty, and designing and analysing algorithms that use computational resources as efficiently as possible. Within this context, the Algorithms and Complexity Theory group at Oxford has particular interest in the following topics:

  • algorithmic game theory and computational economics
  • circuit complexity
  • computational counting problems
  • exact algorithms and fine-grained complexity
  • foundational issues in computational learning
  • online algorithms, and
  • randomised algorithms (including the analysis of stochastic processes, the probabilistic analysis of algorithms and pseudorandomness).

Related seminar series

All Activities


Constraints Group Computational problems from many different application areas can be s…

Read more about Constraints Group

Computational Complexity This sub-group investigates structural complexity. We analyse both ma…

Read more about Computational Complexity

All Projects


MCC The MCC project will enable significant computational advances throug…

Read more about MCC

ALGAME ALGAME is a five-year ERC Advanced Grant that consists mainly of thre…

Read more about ALGAME

All Publications


Dueling Network Architectures for Deep Reinforcement Learning

Read more about Dueling Network Architectures for Deep Reinforcement Learning