( en | de | ru )

 

Disambiguation of "Lauria, Massimo"

Author of the publication

copydeleteadd this publication to your clipboard
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares.

, , and . MFCS, volume 241 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Douglas Lauria

Silvia Lauria

Massimo Viola

Massimo Malagó

Massimo Tallarida

 

Other publications of authors with the same name

The complexity of proving that a graph is Ramsey., , , and . Electron. Colloquium Comput. Complex., (2013)The Power of Negative Reasoning., , , and . CCC, volume 200 of LIPIcs, page 40:1-40:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Redundancy for MaxSAT., , , and . Electron. Colloquium Comput. Complex., (2024)Clique Is Hard on Average for Regular Resolution., , , , , and . J. ACM, 68 (4): 23:1-23:26 (2021)On vanishing sums of roots of unity in polynomial calculus and sum-of-squares., , and . Comput. Complex., 32 (2): 12 (December 2023)On the bounded-hop MST problem on random Euclidean instances., , , , , and . Theor. Comput. Sci., 384 (2-3): 161-167 (2007)Circular (Yet Sound) Proofs., and . CoRR, (2018)Semantic Versus Syntactic Cutting Planes., , and . STACS, volume 47 of LIPIcs, page 35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks., , , , , and . ADHOC-NOW, volume 4104 of Lecture Notes in Computer Science, page 60-72. Springer, (2006)Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances., , , , , and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 89-98. Springer, (2005)