| An Auditable Constraint Programming Solver | 0 | 0.34 | 2022 |
| Certified CNF Translations for Pseudo-Boolean Solving | 0 | 0.34 | 2022 |
| The Power of Negative Reasoning. | 0 | 0.34 | 2021 |
| Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs | 0 | 0.34 | 2021 |
| Clique Is Hard on Average for Regular Resolution | 0 | 0.34 | 2021 |
| Cutting To The Core Of Pseudo-Boolean Optimization: Combining Core-Guided Search With Cutting Planes Reasoning | 0 | 0.34 | 2021 |
| Automating algebraic proof systems is NP-hard | 0 | 0.34 | 2021 |
| Nullstellensatz Size-Degree Trade-Offs From Reversible Pebbling | 0 | 0.34 | 2021 |
| KRW Composition Theorems via Lifting | 0 | 0.34 | 2020 |
| Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. | 0 | 0.34 | 2020 |
| A Cardinal Improvement To Pseudo-Boolean Solving | 0 | 0.34 | 2020 |
| Justifying All Differences Using Pseudo-Boolean Reasoning | 0 | 0.34 | 2020 |
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity | 0 | 0.34 | 2020 |
| Trade-Offs Between Size and Degree in Polynomial Calculus. | 0 | 0.34 | 2020 |
| Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions | 0 | 0.34 | 2020 |
| Simplified and Improved Separations Between Regular and General Resolution by Lifting. | 0 | 0.34 | 2020 |
| Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning | 0 | 0.34 | 2020 |
| Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. | 0 | 0.34 | 2020 |
| Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. | 0 | 0.34 | 2019 |
| On Division Versus Saturation in Pseudo-Boolean Solving. | 1 | 0.35 | 2019 |
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. | 0 | 0.34 | 2019 |
| Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. | 0 | 0.34 | 2019 |
| Divide and Conquer: Towards Faster Pseudo-Boolean Solving. | 0 | 0.34 | 2018 |
| Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. | 0 | 0.34 | 2018 |
| Divide and Conquer: Towards Faster Pseudo-Boolean Solving. | 4 | 0.38 | 2018 |
| Clique is hard on average for regular resolution. | 6 | 0.40 | 2018 |
| Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. | 2 | 0.36 | 2018 |
| Proof Complexity (Dagstuhl Seminar 18051). | 0 | 0.34 | 2018 |
| In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. | 2 | 0.36 | 2018 |
| CNFgen: A Generator of Crafted Benchmarks. | 2 | 0.36 | 2017 |
| Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. | 0 | 0.34 | 2017 |
| Cumulative Space in Black-White Pebbling and Resolution. | 3 | 0.42 | 2017 |
| Supercritical Space-Width Trade-Offs for Resolution. | 0 | 0.34 | 2016 |
| How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity) | 1 | 0.35 | 2016 |
| Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. | 2 | 0.36 | 2016 |
| Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. | 2 | 0.38 | 2016 |
| Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). | 0 | 0.34 | 2015 |
| Hardness of Approximation in PSPACE and Separation Results for Pebble Games | 6 | 0.50 | 2015 |
| Tight Size-Degree Bounds for Sums-of-Squares Proofs. | 1 | 0.36 | 2015 |
| A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. | 5 | 0.38 | 2015 |
| A (Biased) Proof Complexity Survey for SAT Practitioners. | 3 | 0.37 | 2014 |
| Long Proofs of (Seemingly) Simple Formulas. | 8 | 0.46 | 2014 |
| From Small Space to Small Width in Resolution. | 4 | 0.42 | 2014 |
| Narrow Proofs May Be Maximally Long | 5 | 0.42 | 2014 |
| Pebble Games, Proof Complexity, and Time-Space Trade-offs. | 24 | 0.73 | 2013 |
| Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). | 6 | 0.43 | 2013 |
| On the Relative Strength of Pebbling and Resolution | 1 | 0.36 | 2012 |
| Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions | 24 | 0.69 | 2010 |
| Separations of Matroid Freeness Properties | 1 | 0.36 | 2010 |
| Understanding space in resolution: optimal lower bounds and exponential trade-offs. | 5 | 0.41 | 2009 |
