No. Title Author Year
1 An Auditable Constraint Programming Solver Gocht, Stephan et al. 2022
2 Certified CNF Translations for Pseudo-Boolean Solving Gocht, Stephan et al. 2022
3 The Power of Negative Reasoning de Rezende, Susanna F. et al. 2021
4 Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs de Rezende, Susanna F. et al. 2020
5 Trade-Offs Between Size and Degree in Polynomial Calculus Lagarde, Guillaume et al. 2020
6 Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling de Rezende, Susanna F. et al. 2019
7 Proof Complexity (Dagstuhl Seminar 18051) Atserias, Albert et al. 2018
8 Cumulative Space in Black-White Pebbling and Resolution Alwen, Joël et al. 2017
9 Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases Lauria, Massimo et al. 2017
10 Supercritical Space-Width Trade-Offs for Resolution Berkholz, Christoph et al. 2016
11 A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds Miksa, Mladen et al. 2015
12 Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) Biere, Armin et al. 2015
13 Tight Size-Degree Bounds for Sums-of-Squares Proofs Lauria, Massimo et al. 2015
14 From Small Space to Small Width in Resolution Filmus, Yuval et al. 2014
15 Understanding space in resolution: optimal lower bounds and exponential trade-offs Ben-Sasson, Eli et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI