| 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 | Semantic Versus Syntactic Cutting Planes | Filmus, Yuval et al. | 2016 |
| 3 | Tight Size-Degree Bounds for Sums-of-Squares Proofs | Lauria, Massimo et al. | 2015 |
| 4 | From Small Space to Small Width in Resolution | Filmus, Yuval et al. | 2014 |
| 5 | Hardness of Parameterized Resolution | Beyersdorff, Olaf et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |