Pubblicazioni

Depth Lower Bounds in Stabbing Planes for Combinatorial Principles

2022 - Leibniz International Proceedings in Informatics, LIPIcs
Dantchev, S.; Galesi, N.; Ghani, A.; Martin, B.

The power of negative reasoning

2021 - Leibniz International Proceedings in Informatics, LIPIcs
de Rezende, S. F.; Lauria, M.; Nordstrom, J.; Sokolov, D.

Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases

2017 - Leibniz International Proceedings in Informatics, LIPIcs
Lauria, Massimo; Nordström, Jakob

Semantic versus syntactic cutting planes

2016 - Leibniz International Proceedings in Informatics, LIPIcs
Filmus, Yuval; Hrubeš, Pavel; Lauria, Massimo

The space complexity of cutting planes refutations

2015 - Leibniz International Proceedings in Informatics, LIPIcs
Galesi, Nicola; Pudlák, Pavel; Thapen, Neil

Tight size-degree bounds for sums-of-squares proofs

2015 - Leibniz International Proceedings in Informatics, LIPIcs
Lauria, Massimo; Nordström, Jakob

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma