Skip to main content

Algorithms and Complexity Theory

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 here.

 

Related seminar series

All Activities

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

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

Publications

Dueling Network Architectures for Deep Reinforcement Learning

Read more about Dueling Network Architectures for Deep Reinforcement Learning

Research