Skip to main content
What types of page to search?

Popular pages: Undergraduate Postgraduate PhD Accommodation Research International students

Alternatively use our A-Z index.

Computational complexity theory

Computational complexity theory investigates the difficulty of computational problems and classifies them based on the resources required to solve them, such as time, space, or randomness.

It provides a rigorous framework for understanding the limits of efficient computation and helps distinguish between tractable and intractable problems. Our research focuses on characterizing complexity classes, exploring reductions and completeness, and studying the boundaries of algorithmic efficiency.

Opportunities

We welcome opportunities to engage with students, researchers, and industry partner:

  • PhD opportunities: please contact us if you are interested in pursuing a PhD in computational complexity theory
  • Consultancy and research collaborations: we welcome partnerships, consultancy, and knowledge exchange projects with academic, industry, and government partners.

Contact us

Please discuss with relevant academic staff if you are interested in their research.