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.

On the complexity of sampling vertices uniformly from a graph

2018 - Leibniz International Proceedings in Informatics, LIPIcs
Chierichetti, Flavio; Haddadan, Shahrzad

Semantic versus syntactic cutting planes

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

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