Hi! I recently defended my PhD thesis in theoretical computer science at Lund University. My advisor there was Tatyana Turova. Starting December 2026, I will be a postdoc at University of Oxford hosted by Stanislav Živný and funded by the WASP/KAW International Postdoctoral Scholarship. My research concerns computational complexity theory and proof complexity in particular. I am especially interested in understanding the complexity of (random) constraint satisfaction problems from this and related perspectives.

Education

• Ph.D. in Computer Science, Lund University, Lund, Sweden.
• Lic. Eng. in Computer Science, Lund University, Lund, Sweden.
• M.Sc. in Mathematics, joint degree between Stockholm University and KTH Royal Institute of Technology, Stockholm, Sweden.
• B.Sc. in Engineering Physics, KTH Royal Institute of Technology, Stockholm, Sweden.

You can find my CV here.

Papers

• On the Power of Polynomial Calculus over Non-Boolean Domains
  Joint work with Yassine Ghannane, Jakob Nordström, Shuo Pang, Kilian Risse, and Dmitry Sokolov
  Manuscript, 2026
• Lower Bounds for CSP Hierarchies Through Ideal Reduction
  Joint work with Yassine Ghannane and Shuo Pang
  SODA 2026
  [arXiv][conference version]
  [slides from talk at KTH Royal Institute of Technology]
• Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
  Joint work with Susanna de Rezende, Jakob Nordström, Shuo Pang, and Kilian Risse
  FOCS 2023
  [arXiv] [ECCC] [conference version]
  [Jakob’s presentation at FSTTCS 2024]
  [Shuo’s presentation at MIAO Seminar]
  [my presentation at Oberwolfach Workshop 2413] [slides]
  [Shuo’s presentation at Simons Institute]

Theses

• On the Algebraic Proof Complexity of Constraint Satisfaction
  PhD thesis, Lund University.
  [full text (without included papers)]

• Geometric Bounds for Steklov Eigenvalues on Graphs
  Master’s thesis, Stockholm University. Received a Mittag-Leffler Prize from the Stockholm University Department of Mathematics.
  [full text]