Risultati ricerca pubblicazioni

On the complexity of sampling vertices uniformly from a graph

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2018
Chierichetti Flavio, Haddadan Shahrzad

The distortion of locality sensitive hashing

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2017
Chierichetti Flavio, Kumar Ravi, Panconesi Alessandro, Terolli Erisa

Resolution and the binary encoding of combinatorial principles

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

Bounded-depth frege complexity of tseitin formulas for all graphs

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2019
Galesi N., Itsykson D., Riazanov A., Sofronova A.

Tracks from hell - when finding a proof may be easier than checking it

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2018
Almanza M., Leucci S., Panconesi A.

Cryptographic reverse firewalls for interactive proof systems

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2020
Ganesh C., Magri B., Venturi D.

Collaborative procrastination

pubblicato su: Leibniz International Proceedings in Informatics, LIPIcs - 2020
Anagnostopoulos A., Gionis A., Parotsidis N.

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