Dr Silvia Butti

Dr Silvia Butti is a Lecturer in Computer Science at King's College London, Department of Informatics. She previously served as a Senior Research Associate at the University of Oxford, Department of Computer Science, and a Junior Research Fellow at Lady Margaret Hall. Dr Butti earned her PhD in Theoretical Computer Science from the Department of Information and Communication Technologies at UPF Barcelona. Her research focuses on the computational complexity of the constraint satisfaction problem, particularly within the areas of algorithms and complexity theory, and the hardness of approximation.

Silvia Butti is a Lecturer in Computer Science at King's College London, specializing in theoretical computer science. Her research focuses on constraint satisfaction problems (CSPs), including their complexity, approximation, and sparsification. She investigates the interplay between algebraic methods, such as the Weisfeiler-Leman algorithm, and computational complexity in CSPs. Her work also explores promise CSPs, distributed CSPs, and the Sherali-Adams hierarchy. Butti has contributed to understanding the inapproximability of promise equations over finite groups and the role of symmetries in constraint satisfaction. Her research has been presented at major conferences such as STACS and CP.