| Publication | Date of Publication | Type |
|---|
| No feasible interpolation for TC^0-Frege proofs | 2026-05-21 | Paper |
| A study of proof search algorithms for resolution and polynomial calculus | 2026-05-06 | Paper |
| MaxSAT resolution with inclusion redundancy | 2026-02-03 | Paper |
| Exponential separations between restricted resolution and cutting planes proof systems | 2025-10-29 | Paper |
Strength and limitations of Sherali-Adams and nullstellensatz proof systems
Annals of Pure and Applied Logic | 2025-02-04 | Paper |
Polynomial calculus for optimization
Artificial Intelligence | 2025-01-17 | Paper |
| On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems | 2024-12-06 | Paper |
| Polynomial calculus for MaxSAT | 2024-11-26 | Paper |
Propositional proof systems based on maximum satisfiability
Artificial Intelligence | 2021-11-02 | Paper |
| Equivalence between systems stronger than resolution | 2021-04-07 | Paper |
| DRMaxSAT with MaxHS: first contact | 2020-05-20 | Paper |
2-D Tucker is PPA complete
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Community structure in industrial SAT instances
Journal of Artificial Intelligence Research | 2019-10-11 | Paper |
Short proofs of the Kneser-Lovász coloring principle
Information and Computation | 2018-06-14 | Paper |
| Scale-Free Random SAT Instances | 2017-07-12 | Paper |
Quasipolynomial size Frege proofs of Frankl's theorem on the trace of sets
Journal of Symbolic Logic | 2016-08-19 | Paper |
Short proofs of the Kneser-Lovász coloring principle
Automata, Languages, and Programming | 2015-11-04 | Paper |
Short proofs of the Kneser-Lovász coloring principle
Automata, Languages, and Programming | 2015-11-04 | Paper |
The fractal dimension of SAT formulas
Automated Reasoning | 2014-09-26 | Paper |
The fractal dimension of SAT formulas
Automated Reasoning | 2014-09-26 | Paper |
Resolution procedures for multiple-valued optimization
Information Sciences | 2014-08-01 | Paper |
Improved separations of regular resolution from clause learning proof systems
Journal of Artificial Intelligence Research | 2014-05-16 | Paper |
SAT-based MaxSAT algorithms
Artificial Intelligence | 2013-08-23 | Paper |
An improved separation of regular resolution from pool resolution and clause learning
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Resolution for Max-SAT
Artificial Intelligence | 2009-07-09 | Paper |
Efficiently Calculating Evolutionary Tree Measures Using SAT
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Mapping CSP into Many-Valued SAT
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
A Complete Calculus for Max-SAT
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Non-automatizability of bounded-depth Frege proofs
Computational Complexity | 2005-02-23 | Paper |
On the automatizability of resolution and related propositional proof systems
Information and Computation | 2004-10-04 | Paper |
Degree complexity for a modified pigeonhole principle
Archive for Mathematical Logic | 2003-09-16 | Paper |
Optimality of size-width tradeoffs for resolution
Computational Complexity | 2003-08-26 | Paper |
| scientific article; zbMATH DE number 1948187 (Why is no real title available?) | 2003-07-10 | Paper |
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1754651 (Why is no real title available?) | 2002-06-12 | Paper |
On the relative complexity of resolution refinements and cutting planes proof systems
SIAM Journal on Computing | 2001-03-19 | Paper |
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1256738 (Why is no real title available?) | 2000-05-28 | Paper |
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1263234 (Why is no real title available?) | 1999-09-07 | Paper |
| scientific article; zbMATH DE number 1113969 (Why is no real title available?) | 1998-12-14 | Paper |
| scientific article; zbMATH DE number 1223616 (Why is no real title available?) | 1998-11-15 | Paper |
Lower bounds for cutting planes proofs with small coefficients
Journal of Symbolic Logic | 1998-02-02 | Paper |
| scientific article; zbMATH DE number 806744 (Why is no real title available?) | 1995-10-17 | Paper |
The Serial Transitive Closure Problem for Trees
SIAM Journal on Computing | 1995-03-27 | Paper |
Size-depth tradeoffs for Boolean formulae
Information Processing Letters | 1994-04-05 | Paper |
| scientific article; zbMATH DE number 440475 (Why is no real title available?) | 1993-11-28 | Paper |
The deduction rule and linear and near-linear proof simulations
Journal of Symbolic Logic | 1993-10-24 | Paper |
