| Publication | Date of Publication | Type |
|---|
| Experimental Repository for "Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability" | 2024-10-10 | Dataset |
| Certified CNF translations for pseudo-Boolean solving | 2024-07-12 | Paper |
KRW composition theorems via lifting
Computational Complexity | 2024-05-22 | Paper |
| Certified Core-Guided MaxSAT Solving | 2024-04-26 | Paper |
Certified dominance and symmetry breaking for combinatorial optimisation
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
| Experimental Repository for "Certified Core-Guided MaxSAT Solving" | 2023-05-25 | Dataset |
Clique Is Hard on Average for Regular Resolution
Journal of the ACM | 2022-12-08 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
(available as arXiv preprint) | 2022-07-27 | Paper |
| Experimental Repository for "Certified CNF Translations for Pseudo-Boolean Solving" | 2022-06-06 | Dataset |
Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
Constraints | 2022-02-10 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
Computational Complexity | 2021-07-14 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
Computational Complexity | 2021-07-14 | Paper |
| Simplified and improved separations between regular and general resolution by lifting | 2021-04-07 | Paper |
| Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning" | 2020-09-18 | Dataset |
| Using Resolution Proofs to Analyse CDCL SAT solvers | 2020-07-19 | Dataset |
| Composed Pebbling PHP pyramid instances in OPB format | 2020-07-14 | Dataset |
| Experimental Repository for "Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search" | 2020-07-13 | Dataset |
| Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases | 2020-05-26 | Paper |
Supercritical space-width trade-offs for resolution
SIAM Journal on Computing | 2020-02-12 | Paper |
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
(available as arXiv preprint) | 2019-12-01 | Paper |
Clique is hard on average for regular resolution
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers | 2018-08-10 | Paper |
| In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving | 2018-08-10 | Paper |
| Cumulative space in black-white pebbling and resolution | 2018-05-03 | Paper |
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Tight size-degree bounds for sums-of-squares proofs | 2018-01-24 | Paper |
A generalized method for proving polynomial calculus degree lower bounds
(available as arXiv preprint) | 2018-01-24 | Paper |
Supercritical space-width trade-offs for resolution
(available as arXiv preprint) | 2017-12-19 | Paper |
Tight size-degree bounds for sums-of-squares proofs
Computational Complexity | 2017-12-18 | Paper |
Tight size-degree bounds for sums-of-squares proofs
Computational Complexity | 2017-12-18 | Paper |
From small space to small width in resolution
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Narrow proofs may be maximally long
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
From small space to small width in resolution
(available as arXiv preprint) | 2017-03-03 | Paper |
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Space Complexity in Polynomial Calculus
SIAM Journal on Computing | 2015-09-02 | Paper |
Narrow proofs may be spacious, separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Towards an optimal separation of space and length in resolution
Theory of Computing | 2014-10-06 | Paper |
Long proofs of (seemingly) simple formulas
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A (biased) proof complexity survey for SAT practitioners
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Some trade-off results for polynomial calculus (extended abstract)
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On the virtue of succinct proofs
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Pebble games, proof complexity, and time-space trade-offs
Logical Methods in Computer Science | 2013-09-26 | Paper |
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract)
Automata, Languages, and Programming | 2013-08-06 | Paper |
On minimal unsatisfiability and time-space trade-offs for \(k\)-DNF resolution
Automata, Languages and Programming | 2011-07-06 | Paper |
A simplified way of proving trade-off results for resolution
Information Processing Letters | 2010-08-20 | Paper |
Narrow proofs may be spacious: separating space and width in resolution
SIAM Journal on Computing | 2010-03-17 | Paper |
| scientific article; zbMATH DE number 5485584 (Why is no real title available?) | 2009-01-05 | Paper |
Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
(available as arXiv preprint) | N/A | Paper |
