Author of the publication

Proving Unsatisfiability with Hitting Formulas.

, , , , and . ITCS, volume 287 of LIPIcs, page 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Proving Unsatisfiability with Hitting Formulas., , , , and . ITCS, volume 287 of LIPIcs, page 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , and . FOCS, page 24-30. IEEE, (2020)Hard Examples for Common Variable Decision Heuristics.. AAAI, page 1652-1659. AAAI Press, (2020)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)Proving Unsatisfiability with Hitting Formulas., , , , and . CoRR, (2023)How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)., , and . Electron. Colloquium Comput. Complex., (2021)Equality Alone Does not Simulate Randomness., , and . CCC, volume 137 of LIPIcs, page 14:1-14:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Complexity Measures on the Symmetric Group and Beyond (Extended Abstract)., , , , and . ITCS, volume 185 of LIPIcs, page 87:1-87:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Hierarchical Community Structure of Practical Boolean Formulas., , , , , , , and . SAT, volume 12831 of Lecture Notes in Computer Science, page 359-376. Springer, (2021)