Author of the publication

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.

 

Other publications of authors with the same name

Short $Res^*(polylog)$ refutations if and only if narrow $Res$ refutations.. CoRR, (2013)The complexity of proving that a graph is Ramsey., , , and . Combinatorica, 37 (2): 253-268 (2017)On the Automatizability of Polynomial Calculus., and . Theory Comput. Syst., 47 (2): 491-506 (2010)Verification and generation of unrefinable partitions., , , and . Inf. Process. Lett., (March 2023)The complexity of proving that a graph is Ramsey., , , and . Electron. Colloquium Comput. Complex., (2013)Redundancy for MaxSAT., , , and . Electron. Colloquium Comput. Complex., (2024)The Power of Negative Reasoning., , , and . CCC, volume 200 of LIPIcs, page 40:1-40:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Circular (Yet Sound) Proofs., and . SAT, volume 11628 of Lecture Notes in Computer Science, page 1-18. Springer, (2019)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)