Author of the publication

Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers.

, , , , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 233-249. Springer, (2020)

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

The Proof Complexity of Integer Programming.. University of Toronto, Canada, (2021)TFNP Characterizations of Proof Systems and Monotone Circuits., , and . ITCS, volume 251 of LIPIcs, page 30:1-30:40. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stabbing Planes., , , , , , and . ITCS, volume 94 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Random CNFs are Hard for Cutting Planes., , , and . CoRR, (2017)Distribution-Free Testing of Linear Functions on ℝⁿ., and . ITCS, volume 151 of LIPIcs, page 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)Random Θ(log n)-CNFs Are Hard for Cutting Planes., , , and . FOCS, page 109-120. IEEE Computer Society, (2017)On the Power and Limitations of Branch and Cut., , , , , , and . CCC, volume 200 of LIPIcs, page 6:1-6:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Limits of CDCL Learning via Merge Resolution., , , , and . SAT, volume 271 of LIPIcs, page 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers., , , , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 233-249. Springer, (2020)