Massimo Lauria
Title
Cited by
Cited by
Year
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
502015
Narrow proofs may be maximally long
A Atserias, M Lauria, J Nordström
ACM Transactions on Computational Logic (TOCL) 17 (3), 1-30, 2016
422016
Optimality of size-degree tradeoffs for polynomial calculus
N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 12 (1), 4, 2010
372010
A characterization of tree-like resolution size
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 113 (18), 666-671, 2013
292013
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
252013
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
252010
Parameterized complexity of DPLL search procedures
O Beyersdorff, N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013
242013
From small space to small width in resolution
Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals
ACM Transactions on Computational Logic (TOCL) 16 (4), 1-15, 2015
232015
On the automatizability of polynomial calculus
N Galesi, M Lauria
Theory of Computing Systems 47 (2), 491-506, 2010
192010
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
162015
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
162012
Clique is hard on average for regular resolution
A Atserias, I Bonacina, SF de Rezende, M Lauria, J Nordström, ...
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
132018
CNFgen: A generator of crafted benchmarks
M Lauria, J Elffers, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2017
132017
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
132008
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
International Conference on Theory and Applications of Satisfiability …, 2016
122016
Semantic versus syntactic cutting planes
Y Filmus, P Hrubeš, M Lauria
LIPIcs-Leibniz International Proceedings in Informatics 47, 2016
122016
Parameterized complexity of DPLL search procedures
O Beyersdorff, N Galesi, M Lauria
Theory and Applications of Satisfiability Testing-SAT 2011, 5-18, 2011
122011
The complexity of proving that a graph is Ramsey
M Lauria, P Pudlák, V Rödl, N Thapen
Combinatorica 37 (2), 253-268, 2017
102017
Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances
A Clementi, M Di Ianni, A Monti, M Lauria, G Rossi, R Silvestri
Structural Information and Communication Complexity, 565-565, 2005
92005
Tight size-degree bounds for sums-of-squares proofs
M Lauria, J Nordström
computational complexity 26 (4), 911-948, 2017
82017
The system can't perform the operation now. Try again later.
Articles 1–20