Massimo Lauria

77 papers A* 2A 15B 3C 1Journal 51Unranked 5
YearRankTypeTitle / Venue / Authors
2025 A conf
Redundancy Rules for MaxSAT.
SAT
Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2025 J jnl
Redundancy rules for MaxSAT.
CoRR
Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2025 J jnl
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds.
Theory Comput.
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2024 A conf
MaxSAT Resolution with Inclusion Redundancy.
SAT
Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria
2024 J jnl
Redundancy for MaxSAT.
Electron. Colloquium Comput. Complex.
Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2023 J jnl
Circular (Yet Sound) Proofs in Propositional Logic.
ACM Trans. Comput. Log.
Albert Atserias, Massimo Lauria
2023 J jnl
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases.
CoRR
Massimo Lauria, Jakob Nordström
2023 J jnl
Hardness of Approximation in PSPACE and Separation Results for Pebble Games.
CoRR
Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals
2023 J jnl
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares.
Comput. Complex.
Ilario Bonacina, Nicola Galesi, Massimo Lauria
2023 J jnl
Verification and generation of unrefinable partitions.
Inf. Process. Lett.
Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria
2022 B conf
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares.
MFCS
Ilario Bonacina, Nicola Galesi, Massimo Lauria
2022 J jnl
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares.
Electron. Colloquium Comput. Complex.
Ilario Bonacina, Nicola Galesi, Massimo Lauria
2021 J jnl
Clique Is Hard on Average for Regular Resolution.
J. ACM
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2021 A conf
The Power of Negative Reasoning.
CCC
Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov
2021 J jnl
Upper bounds on positional Paris-Harrington games.
Discret. Math.
Lorenzo Carlucci, Massimo Lauria
2021 J jnl
Verification and generation of unrefinable partitions.
CoRR
Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria
2020 J jnl
Clique Is Hard on Average for Regular Resolution.
CoRR
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2019 A conf
Circular (Yet Sound) Proofs.
SAT
Albert Atserias, Massimo Lauria
2018 J jnl
A note about
Inf. Process. Lett.
Massimo Lauria
2018 C conf
Algorithm Analysis Through Proof Complexity.
CiE
Massimo Lauria
2018 J jnl
Circular (Yet Sound) Proofs.
CoRR
Albert Atserias, Massimo Lauria
2018 A* conf
Clique is hard on average for regular resolution.
STOC
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2018 J jnl
Cliques enumeration and tree-like resolution proofs.
Inf. Process. Lett.
Massimo Lauria
2018 J jnl
On semantic cutting planes with very small coefficients.
Inf. Process. Lett.
Massimo Lauria, Neil Thapen
2017 A conf
CNFgen: A Generator of Crafted Benchmarks.
SAT
Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals
2017 A conf
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases.
CCC
Massimo Lauria, Jakob Nordström
2017 J jnl
The complexity of proving that a graph is Ramsey.
Comb.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2017 J jnl
Tight Size-Degree Bounds for Sums-of-Squares Proofs.
Comput. Complex.
Massimo Lauria, Jakob Nordström
2016 J jnl
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
ACM Trans. Comput. Theory
Massimo Lauria
2016 J jnl
Narrow Proofs May Be Maximally Long.
ACM Trans. Comput. Log.
Albert Atserias, Massimo Lauria, Jakob Nordström
2016 J jnl
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies.
ACM Trans. Comput. Log.
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
2016 A conf
Semantic Versus Syntactic Cutting Planes.
STACS
Yuval Filmus, Pavel Hrubes, Massimo Lauria
2016 A conf
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.
SAT
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
2015 J jnl
From Small Space to Small Width in Resolution.
ACM Trans. Comput. Log.
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2015 A* conf
Hardness of Approximation in PSPACE and Separation Results for Pebble Games.
FOCS
Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals
2015 J jnl
Space Complexity in Polynomial Calculus.
SIAM J. Comput.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2015 A conf
Tight Size-Degree Bounds for Sums-of-Squares Proofs.
CCC
Massimo Lauria, Jakob Nordström
2015 J jnl
Tight Size-Degree Bounds for Sums-of-Squares Proofs.
CoRR
Massimo Lauria, Jakob Nordström
2015 J jnl
Tight Size-Degree Bounds for Sums-of-Squares Proofs.
Electron. Colloquium Comput. Complex.
Massimo Lauria, Jakob Nordström
2014 A conf
From Small Space to Small Width in Resolution.
STACS
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014 J jnl
From Small Space to Small Width in Resolution.
CoRR
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014 J jnl
From Small Space to Small Width in Resolution.
Electron. Colloquium Comput. Complex.
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014 A conf
Narrow Proofs May Be Maximally Long.
CCC
Albert Atserias, Massimo Lauria, Jakob Nordström
2014 J jnl
Narrow Proofs May Be Maximally Long.
CoRR
Albert Atserias, Massimo Lauria, Jakob Nordström
2014 J jnl
Narrow Proofs May Be Maximally Long.
Electron. Colloquium Comput. Complex.
Albert Atserias, Massimo Lauria, Jakob Nordström
2013 A conf
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
SAT
Massimo Lauria
2013 J jnl
A characterization of tree-like Resolution size.
Inf. Process. Lett.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2013 J jnl
Parameterized Complexity of DPLL Search Procedures.
ACM Trans. Comput. Log.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2013 J jnl
Short $\mathsf{Res}^*(\mathsf{polylog})$ refutations if and only if narrow $\mathsf{Res}$ refutations.
CoRR
Massimo Lauria
2013 — conf
The Complexity of Proving That a Graph Is Ramsey.
ICALP (1)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey
CoRR
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey.
Electron. Colloquium Comput. Complex.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 — conf
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract).
ICALP (1)
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2012 J jnl
A Characterization of Tree-Like Resolution Size.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2012 J jnl
A rank lower bound for cutting planes proofs of Ramsey Theorem.
Electron. Colloquium Comput. Complex.
Massimo Lauria
2012 J jnl
Parameterized Bounded-Depth Frege Is not Optimal.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov
2012 A conf
Space Complexity in Polynomial Calculus.
CCC
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
2012 J jnl
Space Complexity in Polynomial Calculus.
Electron. Colloquium Comput. Complex.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2011 — conf
Parameterized Bounded-Depth Frege Is Not Optimal.
ICALP (1)
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov
2011 A conf
Parameterized Complexity of DPLL Search Procedures.
SAT
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2011 A conf
Paris-Harrington Tautologies.
CCC
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
2010 J jnl
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2010 J jnl
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games.
Inf. Process. Lett.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2010 — conf
Hardness of Parameterized Resolution.
Circuits, Logic, and Games
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2010 J jnl
Hardness of Parameterized Resolution.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
2010 J jnl
On the Automatizability of Polynomial Calculus.
Theory Comput. Syst.
Nicola Galesi, Massimo Lauria
2010 J jnl
Optimality of size-degree tradeoffs for polynomial calculus.
ACM Trans. Comput. Log.
Nicola Galesi, Massimo Lauria
2010 J jnl
Parameterized Bounded-Depth Frege is Not Optimal.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov
2010 J jnl
Paris-Harrington tautologies.
Electron. Colloquium Comput. Complex.
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
2009 J jnl
On the Automatizability of Polynomial Calculus.
Electron. Colloquium Comput. Complex.
Nicola Galesi, Massimo Lauria
2009 J jnl
Random CNFs require spacious Polynomial Calculus refutations.
Electron. Colloquium Comput. Complex.
Massimo Lauria
2008 J jnl
Minimum-Energy Broadcast and disk cover in grid wireless networks.
Theor. Comput. Sci.
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2007 J jnl
Extending Polynomial Calculus to $k$-DNF Resolution.
Electron. Colloquium Comput. Complex.
Nicola Galesi, Massimo Lauria
2007 J jnl
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci.
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2006 — conf
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
ADHOC-NOW
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2006 B conf
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
SIROCCO
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2005 B conf
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
SIROCCO
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri