Sfoglia per Autore
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
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
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
On the bounded-hop MST problem on random Euclidean instances
2007 Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Gianluca, Rossi; 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
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games
2010 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo
On the Automatizability of Polynomial Calculus
2010 Galesi, Nicola; Lauria, Massimo
Optimality of size-degree tradeoffs for polynomial calculus
2010 Galesi, Nicola; Lauria, Massimo
Paris-Harrington tautologies
2011 Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo
Parameterized bounded-depth Frege is not optimal
2011 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov:
Parameterized complexity of DPLL search procedures
2011 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo
Space complexity in polynomial calculus
2012 Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Thapen, Neil; Ron Zewi, Noga
Parameterized bounded-depth Frege is not optimal
2012 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov
A characterization of tree-like Resolution size
2013 Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract)
2013 Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
A rank lower bound for cutting planes proofs of Ramsey's theorem
2013 Lauria, Massimo
The complexity of proving that a graph is Ramsey
2013 Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil
Parameterized Complexity of DPLL Search Procedures
2013 Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo
Narrow proofs may be maximally long
2014 Atserias, Albert; Lauria, Massimo; Nordström, Jakob
From small space to small width in resolution
2014 Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| 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 | |
| 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 | |
| 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 | |
| On the bounded-hop MST problem on random Euclidean instances | 2007 | Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Gianluca, Rossi; 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 | |
| A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games | 2010 | Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo | |
| On the Automatizability of Polynomial Calculus | 2010 | Galesi, Nicola; Lauria, Massimo | |
| Optimality of size-degree tradeoffs for polynomial calculus | 2010 | Galesi, Nicola; Lauria, Massimo | |
| Paris-Harrington tautologies | 2011 | Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo | |
| Parameterized bounded-depth Frege is not optimal | 2011 | Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov: | |
| Parameterized complexity of DPLL search procedures | 2011 | Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo | |
| Space complexity in polynomial calculus | 2012 | Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Thapen, Neil; Ron Zewi, Noga | |
| Parameterized bounded-depth Frege is not optimal | 2012 | Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov | |
| A characterization of tree-like Resolution size | 2013 | Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo | |
| Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract) | 2013 | Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc | |
| A rank lower bound for cutting planes proofs of Ramsey's theorem | 2013 | Lauria, Massimo | |
| The complexity of proving that a graph is Ramsey | 2013 | Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil | |
| Parameterized Complexity of DPLL Search Procedures | 2013 | Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo | |
| Narrow proofs may be maximally long | 2014 | Atserias, Albert; Lauria, Massimo; Nordström, Jakob | |
| From small space to small width in resolution | 2014 | Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile