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

Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs., , , and . MFCS, volume 138 of LIPIcs, page 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Decision Trees with Symmetries.. CSR, volume 10846 of Lecture Notes in Computer Science, page 282-294. Springer, (2018)Top-Down Lower Bounds for Depth-Four Circuits., , , and . FOCS, page 1048-1055. IEEE, (2023)Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space., , and . CoRR, (2024)Lower Bounds on OBDD Proofs with Several Orders., , , , and . ACM Trans. Comput. Log., 22 (4): 26:1-26:30 (2021)Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs., , , and . Comput. Complex., 30 (2): 13 (2021)Proving Unsatisfiability with Hitting Formulas., , , , and . CoRR, (2023)Sampling and Certifying Symmetric Functions., , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 36:1-36:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Automating OBDD proofs is NP-hard., and . MFCS, volume 241 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hardness Condensation by Restriction., , , and . STOC, page 2016-2027. ACM, (2024)