I research computational complexity, with a focus on proof complexity and impossibility results ("lower bounds") showing that fundamental problems require exponential time under major algorithmic approaches. My work draws on techniques from discrete math, logic, and circuit and communication complexity, with applications in combinatorial optimization, SAT solving, and statistical learning.