Massimo Lauria
Professore Associato
Struttura:
E-mail:
| Title | Published on | Year |
|---|---|---|
| Verification and generation of unrefinable partitions | INFORMATION PROCESSING LETTERS | 2023 |
| Circular (Yet Sound) Proofs in Propositional Logic | ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2023 |
| On vanishing sums of roots of unity in polynomial calculus and sum-of-squares | 2023 | |
| On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares | Leibniz International Proceedings in Informatics, LIPIcs | 2022 |
| On the maximal part in unrefinable partitions of triangular numbers | AEQUATIONES MATHEMATICAE | 2022 |
| Upper bounds on positional Paris–Harrington games | DISCRETE MATHEMATICS | 2021 |
| Clique Is Hard on Average for Regular Resolution | JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY | 2021 |
| The power of negative reasoning | Leibniz International Proceedings in Informatics, LIPIcs | 2021 |
| Circular (Yet Sound) Proofs | Theory and Applications of Satisfiability Testing – SAT 2019 | 2019 |
| Cliques enumeration and tree-like resolution proofs | INFORMATION PROCESSING LETTERS | 2018 |
| Clique is hard on average for regular resolution | Proceedings of the Annual ACM Symposium on Theory of Computing | 2018 |
| Algorithm analysis through proof complexity | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2018 |
| A note about k-DNF resolution | INFORMATION PROCESSING LETTERS | 2018 |
| On semantic cutting planes with very small coefficients | INFORMATION PROCESSING LETTERS | 2018 |
| Tight Size-Degree Bounds for Sums-of-Squares Proofs | COMPUTATIONAL COMPLEXITY | 2017 |
| The complexity of proving that a graph is Ramsey | COMBINATORICA | 2017 |
| Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases | Leibniz International Proceedings in Informatics, LIPIcs | 2017 |
| CNFgen: A generator of crafted benchmarks | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2017 |
| On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies | ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2016 |
| A rank lower bound for cutting Planes Proofs of Ramsey's Theorem | ACM TRANSACTIONS ON COMPUTATION THEORY | 2016 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma