Author of the publication

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation.

, , , and . AAAI, page 3698-3707. AAAI Press, (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.

 

Other publications of authors with the same name

Clique Is Hard on Average for Regular Resolution., , , , , and . CoRR, (2020)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , and . FOCS, page 24-30. IEEE, (2020)Trade-Offs Between Size and Degree in Polynomial Calculus., , , and . ITCS, volume 151 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Relating Proof Complexity Measures and Practical Hardness of SAT., , , and . CP, volume 7514 of Lecture Notes in Computer Science, page 316-331. Springer, (2012)Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract)., , and . PxTP, volume 336 of EPTCS, page 48. (2021)KRW Composition Theorems via Lifting., , , , and . FOCS, page 43-49. IEEE, (2020)Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract)., , , and . IJCAI, page 6436-6441. ijcai.org, (2023)Certified Core-Guided MaxSAT Solving., , , , and . CADE, volume 14132 of Lecture Notes in Computer Science, page 1-22. Springer, (2023)Certified Symmetry and Dominance Breaking for Combinatorial Optimisation., , , and . AAAI, page 3698-3707. AAAI Press, (2022)Proof Logging for the Circuit Constraint., , and . CPAIOR (2), volume 14743 of Lecture Notes in Computer Science, page 38-55. Springer, (2024)