×

zbMATH — the first resource for mathematics

Lauria, Massimo

Compute Distance To:
Author ID: lauria.massimo Recent zbMATH articles by "Lauria, Massimo"
Published as: Lauria, Massimo
External Links: MGP · ORCID
Documents Indexed: 35 Publications since 2005

Publications by Year

Citations contained in zbMATH Open

22 Publications have been cited 77 times in 45 Documents Cited by Year
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract). Zbl 1336.03065
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
11
2013
A characterization of tree-like resolution size. Zbl 1285.68058
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
11
2013
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games. Zbl 1379.03017
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
6
2010
Parameterized complexity of DPLL search procedures. Zbl 1354.68105
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
6
2013
Optimality of size-degree tradeoffs for polynomial calculus. Zbl 1352.03066
Galesi, Nicola; Lauria, Massimo
5
2010
Parameterized complexity of DPLL search procedures. Zbl 1330.68099
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
4
2011
Parameterized bounded-depth Frege is not optimal. Zbl 1322.68082
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo; Razborov, Alexander A.
4
2012
Narrow proofs may be maximally long. Zbl 1367.03104
Atserias, Albert; Lauria, Massimo; Nordström, Jakob
4
2016
Semantic versus syntactic cutting planes. Zbl 1388.03054
Filmus, Yuval; Hrubeš, Pavel; Lauria, Massimo
4
2016
On the automatizability of polynomial calculus. Zbl 1211.03025
Galesi, Nicola; Lauria, Massimo
3
2010
From small space to small width in resolution. Zbl 1359.03042
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
3
2014
CNFgen: a generator of crafted benchmarks. Zbl 06807244
Lauria, Massimo; Elffers, Jan; Nordström, Jakob; Vinyals, Marc
2
2017
From small space to small width in resolution. Zbl 1367.03105
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
2
2015
On the bounded-hop MST problem on random Euclidean instances. Zbl 1125.68138
Clementi, Andrea E. F.; Di Ianni, Miriam; Lauria, Massimo; Monti, Angelo; Rossi, Gianluca; Silvestri, Riccardo
2
2007
Tight size-degree bounds for sums-of-squares proofs. Zbl 1422.03126
Lauria, Massimo; Nordström, Jakob
2
2015
Space complexity in polynomial calculus. Zbl 1372.03099
Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Ron-Zewi, Noga; Thapen, Neil
2
2015
Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances (extended abstract). Zbl 1085.68670
Clementi, Andrea E. F.; Di Ianni, Miriam; Monti, Angelo; Lauria, Massimo; Rossi, Gianluca; Silvestri, Riccardo
1
2005
Parameterized bounded-depth Frege is not optimal. Zbl 1334.03056
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo; Razborov, Alexander
1
2011
Minimum-energy broadcast and disk cover in grid wireless networks. Zbl 1147.68332
Calamoneri, Tiziana; Clementi, Andrea E. F.; di Ianni, Miriam; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo
1
2008
The complexity of proving that a graph is Ramsey. Zbl 1336.03066
Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil
1
2013
Trade-offs between time and memory in a tighter model of CDCL SAT solvers. Zbl 06623511
Elffers, Jan; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc
1
2016
Clique is hard on average for regular resolution. Zbl 1427.68102
Atserias, Albert; Bonacina, Ilario; de Rezende, Susanna F.; Lauria, Massimo; Nordström, Jakob; Razborov, Alexander
1
2018
Clique is hard on average for regular resolution. Zbl 1427.68102
Atserias, Albert; Bonacina, Ilario; de Rezende, Susanna F.; Lauria, Massimo; Nordström, Jakob; Razborov, Alexander
1
2018
CNFgen: a generator of crafted benchmarks. Zbl 06807244
Lauria, Massimo; Elffers, Jan; Nordström, Jakob; Vinyals, Marc
2
2017
Narrow proofs may be maximally long. Zbl 1367.03104
Atserias, Albert; Lauria, Massimo; Nordström, Jakob
4
2016
Semantic versus syntactic cutting planes. Zbl 1388.03054
Filmus, Yuval; Hrubeš, Pavel; Lauria, Massimo
4
2016
Trade-offs between time and memory in a tighter model of CDCL SAT solvers. Zbl 06623511
Elffers, Jan; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc
1
2016
From small space to small width in resolution. Zbl 1367.03105
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
2
2015
Tight size-degree bounds for sums-of-squares proofs. Zbl 1422.03126
Lauria, Massimo; Nordström, Jakob
2
2015
Space complexity in polynomial calculus. Zbl 1372.03099
Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Ron-Zewi, Noga; Thapen, Neil
2
2015
From small space to small width in resolution. Zbl 1359.03042
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
3
2014
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract). Zbl 1336.03065
Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc
11
2013
A characterization of tree-like resolution size. Zbl 1285.68058
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
11
2013
Parameterized complexity of DPLL search procedures. Zbl 1354.68105
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
6
2013
The complexity of proving that a graph is Ramsey. Zbl 1336.03066
Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil
1
2013
Parameterized bounded-depth Frege is not optimal. Zbl 1322.68082
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo; Razborov, Alexander A.
4
2012
Parameterized complexity of DPLL search procedures. Zbl 1330.68099
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
4
2011
Parameterized bounded-depth Frege is not optimal. Zbl 1334.03056
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo; Razborov, Alexander
1
2011
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games. Zbl 1379.03017
Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo
6
2010
Optimality of size-degree tradeoffs for polynomial calculus. Zbl 1352.03066
Galesi, Nicola; Lauria, Massimo
5
2010
On the automatizability of polynomial calculus. Zbl 1211.03025
Galesi, Nicola; Lauria, Massimo
3
2010
Minimum-energy broadcast and disk cover in grid wireless networks. Zbl 1147.68332
Calamoneri, Tiziana; Clementi, Andrea E. F.; di Ianni, Miriam; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo
1
2008
On the bounded-hop MST problem on random Euclidean instances. Zbl 1125.68138
Clementi, Andrea E. F.; Di Ianni, Miriam; Lauria, Massimo; Monti, Angelo; Rossi, Gianluca; Silvestri, Riccardo
2
2007
Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances (extended abstract). Zbl 1085.68670
Clementi, Andrea E. F.; Di Ianni, Miriam; Monti, Angelo; Lauria, Massimo; Rossi, Gianluca; Silvestri, Riccardo
1
2005

Citations by Year