11573/1675246 - 2023 -
Verification and generation of unrefinable partitions Aragona, R; Campioni, L; Civino, R; Lauria, M - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 1-15 - issn: 0020-0190 - wos: WOS:000913177300001 (1) - scopus: 2-s2.0-85146429897 (1)
11573/1675423 - 2023 -
Circular (Yet Sound) Proofs in Propositional Logic Atserias, Albert; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-24 - issn: 1529-3785 - wos: WOS:001020345500002 (0) - scopus: 2-s2.0-85164301709 (1)
11573/1701927 - 2023 -
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares Bonacina, Ilario; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: COMPUTATIONAL COMPLEXITY (Birkhaeuser Verlag AG:Viaduktstrasse 42-44, CH 4051 Basel Switzerland:011 41 61 2050707, EMAIL: subscriptions@birkhauser.ch, INTERNET: http://www.birkhauser.ch, Fax: 011 41 61 2050792) pp. 1-45 - issn: 1016-3328 - wos: WOS:001100965700001 (0) - scopus: 2-s2.0-85176394156 (0)
11573/1675247 - 2022 -
On the maximal part in unrefinable partitions of triangular numbers Aragona, R.; Campioni, L.; Civino, R.; Lauria, M. - 01a Articolo in rivista
paper: AEQUATIONES MATHEMATICAE (Waterloo Ont.; Basel: University of Waterloo; Birkhäuser Verlag, 1968-
Latest publisher: Cham (ZG): Office of publ. Springer International Publishing AG) pp. 1339-1363 - issn: 0001-9054 - wos: WOS:000812492100001 (2) - scopus: 2-s2.0-85132133141 (2)
11573/1654517 - 2022 -
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares Bonacina, I.; Galesi, N.; Lauria, M. - 04b Atto di convegno in volume
conference: International Symposium on Mathematical Foundations of Computer Science (Vienna; Austria)
book: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) - (978-3-95977-256-3)
11573/1675249 - 2021 -
Clique Is Hard on Average for Regular Resolution Atserias, A.; Bonacina, I.; De Rezende, S. F.; Lauria, M.; Nordstrom, J.; Razborov, A. - 01a Articolo in rivista
paper: JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY (ACM / Association for Computing Machinery:1515 Broadway, 17th Floor:New York, NY 10036:(212)869-7440, EMAIL: acmhelp@hq.acm.org, INTERNET: http://www.acm.org, Fax: (212)944-1318) pp. 1-32 - issn: 0004-5411 - wos: WOS:000744649100002 (0) - scopus: 2-s2.0-85122582849 (1)
11573/1527686 - 2021 -
Upper bounds on positional Paris–Harrington games Carlucci, Lorenzo; Lauria, Massimo - 01a Articolo in rivista
paper: DISCRETE MATHEMATICS (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 1-6 - issn: 0012-365X - wos: WOS:000608703700024 (0) - scopus: 2-s2.0-85098692534 (0)
De Rezende, S. F.; Lauria, M.; Nordstrom, J.; Sokolov, D. - 04b Atto di convegno in volume
conference: 36th Computational Complexity Conference, CCC 2021 (can)
book: Leibniz International Proceedings in Informatics, LIPIcs - ()
Atserias, A.; Lauria, M. - 04b Atto di convegno in volume
conference: 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019 (Lisbona)
book: Theory and Applications of Satisfiability Testing – SAT 2019 - (978-3-030-24257-2; 978-3-030-24258-9)
11573/1199263 - 2018 -
Clique is hard on average for regular resolution Atserias, Albert; Lauria, Massimo; Bonacina, Ilario; Nordström, Jakob; De Rezende, Susanna F; Razborov, Alexander - 04b Atto di convegno in volume
conference: 50th Annual ACM Symposium on Theory of Computing, STOC 2018 (usa)
book: Proceedings of the Annual ACM Symposium on Theory of Computing - (9781450355599)
11573/1093853 - 2018 -
Cliques enumeration and tree-like resolution proofs Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 62-67 - issn: 0020-0190 - wos: WOS:000430518100012 (2) - scopus: 2-s2.0-85043464215 (2)
11573/1199284 - 2018 -
Algorithm analysis through proof complexity Lauria, Massimo - 04b Atto di convegno in volume
conference: 14th Conference on Computability in Europe, CiE 2018 (Kiel (Germany))
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783319944173)
Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 33-39 - issn: 0020-0190 - wos: WOS:000438480600006 (4) - scopus: 2-s2.0-85046698727 (6)
11573/1199308 - 2018 -
On semantic cutting planes with very small coefficients Lauria, Massimo; Thapen, Neil - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 70-75 - issn: 0020-0190 - wos: WOS:000435045200015 (1) - scopus: 2-s2.0-85045570534 (1)
Lauria, Massimo; Elffers, Jan; Nordström, Jakob; Vinyals, Marc - 04b Atto di convegno in volume
conference: 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 (aus)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783319662626)
11573/1093860 - 2017 -
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases Lauria, Massimo; Nordström, Jakob - 04b Atto di convegno in volume
conference: 32nd Computational Complexity Conference, CCC 2017 (lva)
book: Leibniz International Proceedings in Informatics, LIPIcs - (9783959770408)
11573/952969 - 2017 -
Tight Size-Degree Bounds for Sums-of-Squares Proofs Lauria, Massimo; Nordström, Jakob - 01a Articolo in rivista
paper: COMPUTATIONAL COMPLEXITY (Birkhaeuser Verlag AG:Viaduktstrasse 42-44, CH 4051 Basel Switzerland:011 41 61 2050707, EMAIL: subscriptions@birkhauser.ch, INTERNET: http://www.birkhauser.ch, Fax: 011 41 61 2050792) pp. 1-38 - issn: 1016-3328 - wos: WOS:000415306000004 (5) - scopus: 2-s2.0-85018513275 (7)
11573/957472 - 2017 -
The complexity of proving that a graph is Ramsey Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil - 01a Articolo in rivista
paper: COMBINATORICA (Springer Verlag Germany:Tiergartenstrasse 17, D 69121 Heidelberg Germany:011 49 6221 3450, EMAIL: g.braun@springer.de, INTERNET: http://www.springer.de, Fax: 011 49 6221 345229) pp. 253-268 - issn: 0209-9683 - wos: WOS:000399890000008 (8) - scopus: 2-s2.0-85018519537 (11)
Atserias, Albert; Lauria, Massimo; Nordström, Jakob - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-30 - issn: 1529-3785 - wos: WOS:000380019200005 (25) - scopus: 2-s2.0-84973879640 (30)
11573/902288 - 2016 -
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-25 - issn: 1529-3785 - wos: WOS:000390984400004 (0) - scopus: 2-s2.0-84987984208 (0)
11573/957820 - 2016 -
Trade-offs between time and memory in a tighter model of CDCL SAT solvers Elffers, Jan; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc - 04b Atto di convegno in volume
conference: 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016 (fra)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783319409696)
11573/957825 - 2016 -
Semantic versus syntactic cutting planes Filmus, Yuval; Hrubeš, Pavel; Lauria, Massimo - 04b Atto di convegno in volume
conference: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 (fra)
book: Leibniz International Proceedings in Informatics, LIPIcs - (9783959770019)
11573/957408 - 2016 -
A rank lower bound for cutting Planes Proofs of Ramsey's Theorem Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATION THEORY (New York, N.Y. : Association for Computing Machinery) pp. 1-13 - issn: 1942-3454 - wos: WOS:000381407300005 (0) - scopus: 2-s2.0-84976444863 (2)
11573/957812 - 2015 -
Hardness of Approximation in PSPACE and Separation Results for Pebble Games Chan, Siu Man; Lauria, Massimo; Nordstrom, Jakob; Vinyals, Marc - 04b Atto di convegno in volume
conference: 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 (usa)
book: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS - (9781467381918)
11573/957485 - 2015 -
From small space to small width in resolution Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-15 - issn: 1529-3785 - wos: WOS:000365216500001 (9) - scopus: 2-s2.0-84941557324 (10)
11573/957543 - 2015 -
Space complexity in polynomial calculus Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Ron Zewi, Noga; Thapen, Neil - 01a Articolo in rivista
paper: SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics:3600 University City Science Center:Philadelphia, PA 19104:(800)447-7426, (215)382-9800, EMAIL: service@siam.org, INTERNET: http://www.siam.org, Fax: (215)386-7999) pp. 1119-1153 - issn: 0097-5397 - wos: WOS:000360654100008 (6) - scopus: 2-s2.0-84940668727 (14)
11573/957805 - 2015 -
Tight size-degree bounds for sums-of-squares proofs Lauria, Massimo; Nordström, Jakob - 04b Atto di convegno in volume
conference: 30th Conference on Computational Complexity, CCC 2015 (usa)
book: Leibniz International Proceedings in Informatics, LIPIcs - (9783939897811)
Atserias, Albert; Lauria, Massimo; Nordström, Jakob - 04b Atto di convegno in volume
conference: 29th Annual IEEE Conference on Computational Complexity, CCC 2014 (Vancouver, BC, can)
book: Proceedings of the Annual IEEE Conference on Computational Complexity - (9781479936267)
11573/957442 - 2014 -
From small space to small width in resolution Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc - 04b Atto di convegno in volume
conference: 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 (Lyon; France)
book: Leibniz International Proceedings in Informatics, LIPIcs - (9783939897651)
11573/718353 - 2013 -
A characterization of tree-like Resolution size Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 666-671 - issn: 0020-0190 - wos: WOS:000322610700005 (19) - scopus: 2-s2.0-84879377601 (25)
11573/957567 - 2013 -
Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract) Filmus, Yuval; Lauria, Massimo; Mikša, Mladen; Nordström, Jakob; Vinyals, Marc - 04b Atto di convegno in volume
conference: 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 (Riga, lva)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783642392054)
11573/957779 - 2013 -
A rank lower bound for cutting planes proofs of Ramsey's theorem Lauria, Massimo - 04b Atto di convegno in volume
conference: 16th International Conference on Theory and Applications of Satisfiability Testing, SAT 2013 (Helsinki, fin)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783642390708)
11573/957592 - 2013 -
The complexity of proving that a graph is Ramsey Lauria, Massimo; Pudlák, Pavel; Rödl, Vojtěch; Thapen, Neil - 04b Atto di convegno in volume
conference: 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 (Riga, lva)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (9783642392054)
11573/496979 - 2013 -
Parameterized Complexity of DPLL Search Procedures Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-21 - issn: 1529-3785 - wos: WOS:000323892900004 (18) - scopus: 2-s2.0-84879381038 (24)
11573/957555 - 2012 -
Space complexity in polynomial calculus Filmus, Yuval; Lauria, Massimo; Nordström, Jakob; Thapen, Neil; Ron Zewi, Noga - 04b Atto di convegno in volume
conference: IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (Porto, prt)
book: Proceedings of the Annual IEEE Conference on Computational Complexity - (9780769547084)
11573/490888 - 2012 -
Parameterized bounded-depth Frege is not optimal Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATION THEORY (New York, N.Y. : Association for Computing Machinery) pp. 1-16 - issn: 1942-3454 - wos: (0) - scopus: 2-s2.0-84868675131 (19)
Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo - 04b Atto di convegno in volume
conference: 26th Annual IEEE Conference on Computational Complexity (CCC) (San Jose, CA)
book: Proceedings of the 26th Annual IEEE Conference on Computational Complexity - (9780769544113)
11573/392502 - 2011 -
Parameterized complexity of DPLL search procedures Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 04b Atto di convegno in volume
conference: 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011 (Ann Arbor, MI)
book: Theory and Applications of Satisfiability Testing - SAT 2011 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings - (9783642215803; 9783642215810)
11573/391744 - 2011 -
Parameterized bounded-depth Frege is not optimal Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov: - 04b Atto di convegno in volume
conference: 38th International Colloquium on Automata, Languages and Programming, ICALP 2011 (Zurich)
book: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 - (9783642220050; 9783642220067)
11573/133664 - 2010 -
Optimality of size-degree tradeoffs for polynomial calculus Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-22 - issn: 1529-3785 - wos: WOS:000284931300004 (22) - scopus: 2-s2.0-78649352528 (20)
11573/208782 - 2010 -
On the Automatizability of Polynomial Calculus Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: THEORY OF COMPUTING SYSTEMS (Springer-Verlag New York Incorporated:175 Fifth Avenue:New York, NY 10010:(212)460-1500, EMAIL: orders@springer-ny.com, INTERNET: http://www.springer-ny.com, Fax: (212)533-3503) pp. 491-506 - issn: 1432-4350 - wos: WOS:000278029300008 (12) - scopus: 2-s2.0-77952958208 (17)
11573/133793 - 2010 -
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 1074-1077 - issn: 0020-0190 - wos: WOS:000284388500009 (13) - scopus: 2-s2.0-77957276708 (20)
11573/366211 - 2008 -
Minimum-Energy Broadcast and disk cover in grid wireless networks Calamoneri, Tiziana; Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo - 01a Articolo in rivista
paper: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 38-53 - issn: 0304-3975 - wos: WOS:000256557900004 (4) - scopus: 2-s2.0-42749091993 (6)
conference: 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2006) (Chester, ENGLAND)
11573/362188 - 2007 -
On the bounded-hop MST problem on random Euclidean instances Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Gianluca, Rossi; Silvestri, Riccardo - 01a Articolo in rivista
paper: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 161-167 - issn: 0304-3975 - wos: WOS:000250387800004 (5) - scopus: 2-s2.0-34548509229 (5)
conference: 12th International Colloquium on Structural Information and Communication Complexity (Mont St Michel, FRANCE)
11573/367462 - 2006 -
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Gianluca, Rossi; Silvestri, Riccardo - 04b Atto di convegno in volume
conference: 5th International Conference on Ad-Hoc, Mobile, and Wireless Networks on Ad-Hoc, Mobile, and Wireless Networks (Ottawa, Canada, August 17-19, 2006)
book: Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, ADHOC-NOW 2006, Ottawa, Canada, August 17-19, 2006, Proceedings - (9783540372462)
11573/366304 - 2006 -
Minimum energy broadcast and disk cover in grid wireless networks Calamoneri, Tiziana; Andrea E. F., Clementi; Miriam Di, Ianni; Lauria, Massimo; Monti, Angelo; Silvestri, Riccardo - 04b Atto di convegno in volume
conference: 13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006 (Chester)
book: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings - (9783540354741; 9783540354758)
11573/366647 - 2005 -
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances Clementi A. E., F; Di Ianni, M; Lauria, Massimo; Rossi, G; Monti, Angelo; Silvestri, Riccardo - 04b Atto di convegno in volume
conference: 12th International Colloquium on Structural Information and Communication Complexity (Le Mont Saint-Michel, FRANCE)
book: Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings - (9783540260523)