Pubblicazioni

Circular (Yet Sound) Proofs

2019 - Theory and Applications of Satisfiability Testing – SAT 2019
Atserias, A.; Lauria, M.

On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies

2016 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo

Narrow proofs may be maximally long

2016 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Atserias, Albert; Lauria, Massimo; Nordström, Jakob

From small space to small width in resolution

2015 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc

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