Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Massimo Lauria
Observed name:
Lauria, Massimo
Institution:
Sapienza University of Rome
Observed institutions:
Tokyo Institute of Technology,
Sapienza University of Rome,
KTH Royal Institute of Technology,
Universitat Politècnica de Catalunya
ORCID:
0000-0003-4003-3168
Observed ORCID:
0000-0003-4003-3168
OpenAlex ID:
A5024267515
Narrow Proofs May Be Maximally Long
2016
·
Albert Atserias
, Massimo Lauria
, et al.
·
ACM Transactions on Computational Logic
·
71
CNFgen: A Generator of Crafted Benchmarks
2017
·
Massimo Lauria
, Jan Elffers
, et al.
·
Lecture notes in computer science
·
66
A characterization of tree-like Resolution size
2013
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
59
PDF
Space Complexity in Polynomial Calculus
2015
·
Yuval Filmus
, Massimo Lauria
, et al.
·
SIAM Journal on Computing
·
47
PDF
Optimality of size-degree tradeoffs for polynomial calculus
2010
·
Nicola Galesi
, Massimo Lauria
·
ACM Transactions on Computational Logic
·
45
From Small Space to Small Width in Resolution
2015
·
Yuval Filmus
, Massimo Lauria
, et al.
·
ACM Transactions on Computational Logic
·
39
Parameterized Complexity of DPLL Search Procedures
2013
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
ACM Transactions on Computational Logic
·
36
PDF
Parameterized Bounded-Depth Frege Is Not Optimal
2011
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
ACM Transactions on Computation Theory
·
31
PDF
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
2015
·
Siu Man Chan
, Massimo Lauria
, et al.
·
Annual Symposium on Foundations of Computer Science
·
29
PDF
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
2013
·
Yuval Filmus
, Massimo Lauria
, et al.
·
Lecture notes in computer science
·
29
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
2010
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
27
PDF
On the Automatizability of Polynomial Calculus
2009
·
Nicola Galesi
, Massimo Lauria
·
Theory of Computing Systems
·
27
Clique is hard on average for regular resolution
2018
·
Albert Atserias
, Ilario Bonacina
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
26
PDF
Semantic Versus Syntactic Cutting Planes
2016
·
Filmus, Yuval
, Hrubeš, Pavel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
21
PDF
Space Complexity in Polynomial Calculus
2012
·
Yuval Filmus
, Massimo Lauria
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
21
Circular (Yet Sound) Proofs
2019
·
Albert Atserias
, Massimo Lauria
·
Lecture notes in computer science
·
20
The complexity of proving that a graph is Ramsey
2016
·
Massimo Lauria
, Pavel Pudlák
, et al.
·
COMBINATORICA
·
17
PDF
Narrow Proofs May Be Maximally Long
2014
·
Albert Atserias
, Massimo Lauria
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
17
PDF
The Power of Negative Reasoning
2021
·
de Rezende, Susanna F.
, Lauria, Massimo
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
15
PDF
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
2005
·
Andrea E. F. Clementi
, Miriam Di Ianni
, et al.
·
Lecture notes in computer science
·
12
Clique Is Hard on Average for Regular Resolution
2021
·
Albert Atserias
, Ilario Bonacina
, et al.
·
Journal of the ACM
·
11
Tight Size-Degree Bounds for Sums-of-Squares Proofs
2017
·
Massimo Lauria
, Jakob Nordström
·
Computational Complexity
·
11
PDF
Minimum-Energy Broadcast and disk cover in grid wireless networks
2008
·
Tiziana Calamoneri
, Andrea E.F. Clementi
, et al.
·
Theoretical Computer Science
·
11
PDF
From Small Space to Small Width in Resolution
2014
·
Filmus, Yuval
, Lauria, Massimo
, et al.
·
arXiv (Cornell University)
·
10
PDF
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
2016
·
Jan Elffers
, Jan Johannsen
, et al.
·
Lecture notes in computer science
·
9
Show more works
View as search
Works count:
73
Citation count:
806
H-index:
17
I10-index:
24
Year
Topic
Type