Pubblicazioni

Clique is hard on average for regular resolution

2018 - Proceedings of the Annual ACM Symposium on Theory of Computing
Atserias, Albert; Lauria, Massimo; Bonacina, Ilario; Nordström, Jakob; De Rezende, Susanna F; Razborov, Alexander

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

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