Pubblicazioni

Resolution and the binary encoding of combinatorial principles

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

Bounded-depth frege complexity of tseitin formulas for all graphs

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

Fragments of bag relational algebra: Expressiveness and certain answers

2019 - Leibniz International Proceedings in Informatics, LIPIcs
Console, M.; Guagliardo, P.; Libkin, L.

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