No. Title Author Year
1 Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases Lauria, Massimo et al. 2017
2 Supercritical Space-Width Trade-Offs for Resolution Berkholz, Christoph et al. 2016
3 A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds Miksa, Mladen et al. 2015
4 Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) Biere, Armin et al. 2015
5 Tight Size-Degree Bounds for Sums-of-Squares Proofs Lauria, Massimo et al. 2015
6 From Small Space to Small Width in Resolution Filmus, Yuval et al. 2014
7 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: 7


DROPS-Home | Fulltext Search | Imprint Published by LZI