Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity. 53rd Annual ACM Symposium on Theory of Computing (STOC) 2021.
From Classical Proof Theory to P vs. NP: a Guide to Bounded Theories. Plenary Talk, 28th EACSL Annual Conference on Computer Science Logic (CSL) 2020.
[slides]
Can a Natural Number Be Negative?Banff Center, Proof Complexity Workshop 2020: 50 minutes talk, Banff, Alberta, Canada, January 18-24 2020.
[slides]
[Video]
Algebraic Proof Complexity: Survey and Open Problems. Universite Paris Diderot, Paris, France, Workshop on Algebraic Complexity Theory (WACT 2018): 50 minutes talk, 2018.
[slides][abstract]
Linear Algebra in Weak Formal Theories of Arithmetic. Oxford University, Algorithms and complexity Seminar: 50 minutes talk, 2018.
[slides]
Resolution over Linear Equations: Survey and Open Problems. Oberwolfach, 2017Proof Complexity Workshop: 25 minutes talk, 2017.
[slides]
Characterizing Propositional Proofs as Non-Commutative Formulas. Tel Aviv, Israel. Work. Algebraic Complexity (WACT 2016).: 50 minutes talk, 2016.
Frege Lower Bounds and Algebraic Circuit Complexity. St. Petersburg, Proof Complexity Workshop: 50 minutes talk, 2016.
[slides]
A New Characterization of Propositional Proofs. Oxford University, (Algorithms Seminar): 50 minutes talk, 2015.
[slides]
Hard instances for strong proof systems via matrix algebras? Vienna, Austria, (FLoC) Vienna Summer of Logic: Proof Complexity 2014.
[slides]
From classical proof theory to P vs. NP. Beijing, China, Logic Conference: Tsinghua 2013--Foundation and Applications: 40 minutes talk.
[slides]
Algebras of polynomial identities and lower bounds on arithmetic proofs, Workshop in Algebraic Complexity Theory, CTIC, Aarhus University, Denmark, March 2013.
[slides]
Short proofs for the determinant identities Rome, Italy,
Workshop on the Limits of Theorem Proving: 45 minutes talk, Sep. 2012.
[slides]
Recent developments in algebraic and
propositional proof complexity. Dubrovnik, Croatia, The 13th Int. Workshop on Logic and Computational
Complexity (LCC '12) : 45 minutes talk, June 2012.
[slides]
Proof
complexity of dense random 3CNF formulas, Banff Center, Canada, Workshop on Proof Complexity: 45 minutes talk, Oct. 2011.
[slides from lics'12]
Algebraic proofs in noncommutative
models, 7th Annual Conference on Theory and Applications of Models of Computation:
special session on proof complexity ; half an hour talk, June 2010.
[slides]
Proofs
of polynomial identities
Intractability center, Institute of Advanced Study and Princeton U., New Jersey,
U.S., Barriers in Complexity Theory Workshop; half an hour talk.
[slides]
Bounds on equational proofs of polynomial identities, Charles University, Prague, Fall School in Logic and Complexity, Czech Rep.;
two hours invited talk, Sep. 2008.
[slides]
Resolution over linear equations and multilinear proofs,
Fall School in Logic and Complexity, Trest, Czech Rep.; two hours invited talk, Sep. 2007.
Blackboard talk, no slides.
The strength of multilinear proofs, Isaac Newton Institute of Mathematics, Cambridge University, U.K., New directions in proof complexity workshop; one hour invited talk, Apr. 2006. [slides]