Pubblicazioni

Clique Is Hard on Average for Regular Resolution

2021 - JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
Atserias, A.; Bonacina, I.; De Rezende, S. F.; Lauria, M.; Nordstrom, J.; Razborov, A.

Resolution and the binary encoding of combinatorial principles

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

Cliques enumeration and tree-like resolution proofs

2018 - INFORMATION PROCESSING LETTERS
Lauria, Massimo

Using SVM to combine global heuristics for the Standard Quadratic Problem

2015 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Dellepiane, Umberto; Palagi, Laura

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