Pubblicazioni

On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares

2022 - Leibniz International Proceedings in Informatics, LIPIcs
Bonacina, I.; Galesi, N.; Lauria, M.

The power of negative reasoning

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

Polynomial calculus space and resolution width

2019 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Galesi, N.; Kolodziejczyk, L.; Thapen, N.

Space proof complexity for random 3-CNFs

2017 - INFORMATION AND COMPUTATION
Bennett, Patrick; Bonacina, Ilario; Galesi, Nicola; Huynh, Tony; Molloy, Mike; Wollan, PAUL JOSEPH

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

A framework for space complexity in algebraic proof systems

2016 - JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
Bonacina, Ilario; Galesi, Nicola

From small space to small width in resolution

2015 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc

Space complexity in polynomial calculus

2015 - SIAM JOURNAL ON COMPUTING
Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Ron Zewi, Noga; Thapen, Neil

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