Some talks I gave

Algorithmic
Complexity of Certified Unsatisfiability (I.e., Complexity of Proof
Search). Talk I gave at 26th International Conference on Theory
and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy,
July 2023.

Automating
Resolution is NPHard. Talk I gave at 60th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2019),
Baltimore, Maryland, USA, November 2019.

Limits of Linear and Semidefinite Relaxations for Combinatorial Problems. Talk I gave at Discrete Mathematics Days (DMD 2018), Sevilla, Spain, June 2018.

Selected
Topics on SemiAlgebraic Proof Complexity. Talk I gave at Workshop
on Proof Complexity and Beyond, Oberwolfach Research Institute
for Mathematics, Oberwolfach, Germany, August 2017.

Gaps Between
Classical Satisfiability Problems and Their Quantum
Relaxations. Talk I gave at Workshop on Graph Theory and
Combinatorics at Foundations of Computational Mathematics (FOCM 2017),
Barcelona, Spain, July 2017.

On Continuous and Combinatorial
Relaxations of Graph Isomorphism. I gave variants of this talk
several times with different titles; this one is the version I gave at
the theory of computing seminar at Technion, Israel, February 2014.

MiniTutorial on SemiAlgebraic Proof Systems. I gave this talk at the BIRS Workshop on Theoretical Foundations of Applied SAT Solving, Banff, Canada, January 2014.

Weak Pigeonhole Principles, Circuits for Approximate Counting, and BoundedDepth Proofs. This is a (biased) survey talk on the topics of the title. I gave this talk at the theory of computing seminar at Tsinghua University, Beijing, China, July 2014.
