Libor Barto

Libor Barto is a professor of mathematics at the Faculty of Mathematics and Physics of Charles University, where he works in the Department of Algebra. His research lies at the interface of universal algebra, logic, and theoretical computer science, with a particular focus on the complexity of constraint satisfaction problems, including exact, approximate, and infinite‑domain variants. His research program aims to transform fragmented, ad hoc complexity results into a coherent theory explaining when and why efficient computation is possible. He was the recipient of an ERC Consolidator Grant (CoCoSym – Symmetry in Computational Complexity) and is currently a Principal Investigator, together with Manuel Bodirsky and Michael Pinsker, of the ERC Synergy Grant POCOCOP – Polynomial‑time Computation: Opening the Black Boxes in Constraint Problems.