PhD in Algorithms and Complexity in Leeds United Kingdom | University of Leeds

Theoretical Computer Science establishes the core principles behind computing. A key objective is to create mathematically rigorous frameworks for designing advanced algorithms to solve practical challenges. This involves mathematically modeling algorithmic methods, assessing computational problem complexity, and exploring efficiency boundaries through computational complexity theory. The Algorithms and Complexity research area is directed by Professor Kristina Vukovi. Investigations within this domain encompass graph theory, logic and model theory, combinatorial optimization, scheduling theory, graph algorithms and data structures, complexity analysis of discrete structure problems, randomized methods, probabilistic algorithm evaluation, and approximation techniques.