I’m a computer scientist working in computational complexity theory. I’m interested in the limits of efficient computation and reasoning and in the interplay between the two. I work primarily in proof complexity. Proof complexity studies the limitations of formal proof systems with the goal of showing that some tautologies require exceedingly large proofs in these systems.
I graduated with a PhD from the Technical University of Catalonia in 2022. Afterwards I have worked as a postdoctoral researcher first at Imperial College London and then in University of Helsinki. In 2023 I spent two months as a visiting postdoctoral researcher at Simons Institute for the Theory of Computing in Berkeley.