Massimo Lauria
Professore Associato
Struttura:
E-mail:
| Title | Published on | Year |
|---|---|---|
| Narrow proofs may be maximally long | ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2016 |
| Trade-offs between time and memory in a tighter model of CDCL SAT solvers | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2016 |
| Semantic versus syntactic cutting planes | Leibniz International Proceedings in Informatics, LIPIcs | 2016 |
| From small space to small width in resolution | ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2015 |
| Space complexity in polynomial calculus | SIAM JOURNAL ON COMPUTING | 2015 |
| Tight size-degree bounds for sums-of-squares proofs | Leibniz International Proceedings in Informatics, LIPIcs | 2015 |
| Hardness of Approximation in PSPACE and Separation Results for Pebble Games | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2015 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma