Pubblicazioni

On approximating the stationary distribution of time-reversible Markov chains

2018 - Leibniz International Proceedings in Informatics, LIPIcs
Bressan, Marco; Peserico, Enoch; Pretto, Luca

On the complexity of sampling vertices uniformly from a graph

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

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