Next Generation of (Parameterized) Algorithms for Problems in AI

The Algorithms group at the University of Leeds (UK) is offering a fully funded 3 year PhD studentship on the development of Parameterized Algorithms for Problems in Artificial Intelligence and Logic. Parameterized Complexity is a vastly growing area within theoretical computer science that allows for the development of exact algorithms for computational hard problems that exploit the structuredness of real-world instances. The goal of this project is to develop more efficient parameterized algorithms for a wide range of problems in computer science such as satisfiability of propositional formulas, constraint satisfaction, integer linear programming, as well as problems from graph theory and machine learning with the help of sophisticated algorithmic techniques such as meta-theorems, dynamic programming, decompositions, and backdoor sets.