| Publication | Date of Publication | Type |
|---|
On the consistency of stronger lower bounds for \(\mathsf{NEXP}\)
Logical Methods in Computer Science | 2026-02-13 | Paper |
Polynomial calculus space and resolution width
Theory of Computing | 2026-02-10 | Paper |
| The strength of the dominance rule | 2026-02-03 | Paper |
| TFNP intersections through the Lens of feasible disjunction | 2025-11-04 | Paper |
A simple supercritical tradeoff between size and height in resolution
Information Processing Letters | 2025-10-23 | Paper |
| Polynomial calculus space and resolution width | 2025-08-12 | Paper |
| Total space in resolution | 2025-08-05 | Paper |
First-order reasoning and efficient semi-algebraic proofs
Annals of Pure and Applied Logic | 2024-10-07 | Paper |
Approximate counting and NP search problems
Journal of Mathematical Logic | 2022-12-13 | Paper |
| Notes on switching lemmas | 2022-02-11 | Paper |
scientific article; zbMATH DE number 7350778 (Why is no real title available?)
(available as arXiv preprint) | 2021-05-25 | Paper |
| scientific article; zbMATH DE number 7350778 (Why is no real title available?) | 2021-05-25 | Paper |
Cobham recursive set functions and weak set theories
Sets and Computations | 2020-12-02 | Paper |
| Random resolution refutations | 2020-05-26 | Paper |
| DRAT proofs, propagation redundancy, and extended resolution | 2020-05-20 | Paper |
Feasible set functions have small circuits
Computability | 2019-10-28 | Paper |
DRAT and Propagation Redundancy Proofs Without New Variables
(available as arXiv preprint) | 2019-09-01 | Paper |
Random resolution refutations
Computational Complexity | 2019-07-10 | Paper |
On semantic cutting planes with very small coefficients
Information Processing Letters | 2018-05-25 | Paper |
The complexity of proving that a graph is Ramsey
Combinatorica | 2018-03-16 | Paper |
| scientific article; zbMATH DE number 6829289 (Why is no real title available?) | 2018-01-24 | Paper |
The strength of replacement in weak arithmetic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Total space in resolution
SIAM Journal on Computing | 2016-10-28 | Paper |
A tradeoff between length and width in resolution
Theory of Computing | 2016-08-22 | Paper |
Cobham recursive set functions
Annals of Pure and Applied Logic | 2016-01-12 | Paper |
The ordering principle in a fragment of approximate counting
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Space complexity in polynomial calculus
SIAM Journal on Computing | 2015-09-02 | Paper |
Fragments of approximate counting
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Parity Games and Propositional Proofs
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
How much randomness is needed for statistics?
Annals of Pure and Applied Logic | 2014-06-06 | Paper |
Parity Games and Propositional Proofs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The complexity of proving that a graph is Ramsey
Lecture Notes in Computer Science | 2013-08-06 | Paper |
How much randomness is needed for statistics?
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Alternating minima and maxima, Nash equilibria and bounded arithmetic
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Archive for Mathematical Logic | 2011-11-23 | Paper |
The provably total search problems of bounded arithmetic
Proceedings of the London Mathematical Society | 2011-07-27 | Paper |
The polynomial and linear time hierarchies in V<sup>0</sup>
MLQ | 2009-10-14 | Paper |
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails
Journal of Symbolic Logic | 2008-06-09 | Paper |
The Polynomial and Linear Hierarchies in V0
Lecture Notes in Computer Science | 2007-11-13 | Paper |
NP search problems in low fragments of bounded arithmetic
Journal of Symbolic Logic | 2007-07-09 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Structures interpretable in models of bounded arithmetic
Annals of Pure and Applied Logic | 2005-10-26 | Paper |
A note on Δ<sub>1</sub>induction and Σ<sub>1</sub>collection
Fundamenta Mathematicae | 2005-09-29 | Paper |
Weak theories of linear algebra
Archive for Mathematical Logic | 2005-03-02 | Paper |
A model-theoretic characterization of the weak pigeonhole principle
Annals of Pure and Applied Logic | 2002-12-02 | Paper |
