Follow
Massimo Lauria
Title
Cited by
Cited by
Year
Narrow proofs may be maximally long
A Atserias, M Lauria, J Nordström
ACM Transactions on Computational Logic (TOCL) 17 (3), 1-30, 2016
622016
Space complexity in polynomial calculus
Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen
SIAM Journal on Computing 44 (4), 1119-1153, 2015
612015
CNFgen: A generator of crafted benchmarks
M Lauria, J Elffers, J Nordström, M Vinyals
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
562017
Optimality of size-degree tradeoffs for polynomial calculus
N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 12 (1), 4, 2010
482010
A characterization of tree-like resolution size
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 113 (18), 666-671, 2013
372013
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 110 (23), 1074-1077, 2010
352010
Parameterized complexity of DPLL search procedures
O Beyersdorff, N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013
332013
Clique is hard on average for regular resolution
A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ...
Journal of the ACM (JACM) 68 (4), 1-26, 2021
322021
Towards an understanding of polynomial calculus: New separations and lower bounds
Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals
International Colloquium on Automata, Languages, and Programming, 437-448, 2013
322013
Hardness of approximation in PSPACE and separation results for pebble games
SM Chan, M Lauria, J Nordstrom, M Vinyals
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 466-485, 2015
302015
Parameterized bounded-depth Frege is not optimal
O Beyersdorff, N Galesi, M Lauria, AA Razborov
ACM Transactions on Computation Theory (TOCT) 4 (3), 1-16, 2012
252012
On the automatizability of polynomial calculus
N Galesi, M Lauria
Theory of Computing Systems 47 (2), 491-506, 2010
242010
Semantic versus syntactic cutting planes
Y Filmus, P Hrubeš, M Lauria
LIPIcs-Leibniz International Proceedings in Informatics 47, 2016
202016
Circular (yet sound) proofs
A Atserias, M Lauria
Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019
192019
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gr\"{o} bner Bases
M Lauria, J Nordström
arXiv preprint arXiv:2306.00125, 2023
182023
The complexity of proving that a graph is Ramsey
M Lauria, P Pudlák, V Rödl, N Thapen
Combinatorica 37, 253-268, 2017
162017
The power of negative reasoning
SF de Rezende, M Lauria, J Nordström, D Sokolov
36th Computational Complexity Conference (CCC 2021), 2021
152021
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
J Elffers, J Johannsen, M Lauria, T Magnard, J Nordström, M Vinyals
Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016
152016
Minimum-energy broadcast and disk cover in grid wireless networks
T Calamoneri, AEF Clementi, M Di Ianni, M Lauria, A Monti, R Silvestri
Theoretical Computer Science 399 (1-2), 38-53, 2008
152008
From small space to small width in resolution
Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals
arXiv preprint arXiv:1409.2978, 2014
142014
The system can't perform the operation now. Try again later.
Articles 1–20