I am a postdoc at the University of Copenhagen. My research is in computational complexity and discrete math, where I focus on proof complexity and optimization.
• Sum-of-Squares lower bound for Non-Gaussian Component Analysis
In preparation
Joint with Ilias Diakonikolas, Sushrut Karmalkar, and Aaron Potechin
• Supercritical and robust tradeoffs for resolution depth versus width and Weisfeiler-Leman
In preparation
Joint with Duri Janett and Jakob Nordström
• Graph colouring is hard on average for polynomial calculus and Nullstellensatz, 2023.
Joint with Jonas Conneryd, Susanna de Rezende, Jakob Nordström, and Kilian Risse
FOCS2023
• SoS lower bound for exact planted clique, 2021.
CCC2021
• On CDCL-based proof systems with the ordered decision strategy, 2019.
Joint with Nathan Mull and Alexander Razborov
SAT2020, SICOMP2022
• Large clique is hard on average for resolution, 2019.
CSR2021