LAURIA, MASSIMO

LAURIA, MASSIMO  

DIPARTIMENTO DI SCIENZE STATISTICHE  

Mostra prodotti
Risultati 1 - 20 di 47 (tempo di esecuzione: 0.032 secondi).
Titolo Data di pubblicazione Autore(i) File
A characterization of tree-like Resolution size 2013 Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. 2006 ANDREA E. F., Clementi; MIRIAM DI, Ianni; Lauria, Massimo; Monti, Angelo; Gianluca, Rossi; Silvestri, Riccardo
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games 2010 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo
A note about k-DNF resolution 2018 Lauria, Massimo
A rank lower bound for cutting Planes Proofs of Ramsey's Theorem 2016 Lauria, Massimo
A rank lower bound for cutting planes proofs of Ramsey's theorem 2013 Lauria, Massimo
Algorithm analysis through proof complexity 2018 Lauria, Massimo
Circular (Yet Sound) Proofs 2019 Atserias, A.; Lauria, M.
Circular (Yet Sound) Proofs in Propositional Logic 2023 Atserias, Albert; Lauria, Massimo
Clique is hard on average for regular resolution 2018 Atserias, Albert; Lauria, Massimo; Bonacina, Ilario; Nordström, Jakob; De Rezende, Susanna F; Razborov, Alexander
Clique Is Hard on Average for Regular Resolution 2021 Atserias, A.; Bonacina, I.; De Rezende, S. F.; Lauria, M.; Nordstrom, J.; Razborov, A.
Cliques enumeration and tree-like resolution proofs 2018 Lauria, Massimo
CNFgen: A generator of crafted benchmarks 2017 Lauria, Massimo; Elffers, Jan; Nordström, Jakob; Vinyals, Marc
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances 2005 CLEMENTI A. E., F; DI IANNI, M; Lauria, Massimo; Rossi, G; Monti, Angelo; Silvestri, Riccardo
From small space to small width in resolution 2015 Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
From small space to small width in resolution 2014 Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases 2017 Lauria, Massimo; Nordström, Jakob
Hardness of Approximation in PSPACE and Separation Results for Pebble Games 2015 Chan, Siu Man; Lauria, Massimo; Nordstrom, Jakob; Vinyals, Marc
Minimum energy broadcast and disk cover in grid wireless networks 2006 Calamoneri, Tiziana; Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo
Minimum-Energy Broadcast and disk cover in grid wireless networks 2008 Calamoneri, Tiziana; Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo