福利姬

Leif Eriksson at the Department of Computer and Information Science (IDA) defends his thesis entitled: " Infinite-Domain CSPs and QBF: Fine-Grained and Parameterized Complexity." Main Supervisor: Victor Lagerkvist, Senior Associate Professor,...

On the 3rd of June, George Osipov successfully defended his thesis in the intersection of theoretical computer science and artificial intelligence (AI), with a focus on parameterized complexity of constraint satisfaction problems (CSPs).