( en | de | ru )

 

Disambiguation of "Chew, Leroy"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.

, , , and . AAAI, page 7978-7986. AAAI Press, (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.

William Chew

Wakene Negassa Chewaka

Esther Leroy

Antoine Leroy

Herbert Leroy

 

Other publications of authors with the same name

Proof Simulation via Round-based Strategy Extraction for QBF.. Electron. Colloquium Comput. Complex., (2023)Hardness of Random Reordered Encodings of Parity for Resolution and CDCL., , , and . AAAI, page 7978-7986. AAAI Press, (2024)How QBF Expansion Makes Strategy Extraction Hard., and . IJCAR (1), volume 12166 of Lecture Notes in Computer Science, page 66-82. Springer, (2020)Avoiding Monochromatic Rectangles Using Shift Patterns., , and . CoRR, (2020)Understanding Nullstellensatz for QBFs., , , and . Electron. Colloquium Comput. Complex., (2023)Hardness and Optimality in QBF Proof Systems Modulo NP.. Electron. Colloquium Comput. Complex., (2018)Relating Existing Powerful Proof Systems for QBF., and . SAT, volume 236 of LIPIcs, page 10:1-10:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hardness and Optimality in QBF Proof Systems Modulo NP.. SAT, volume 12831 of Lecture Notes in Computer Science, page 98-115. Springer, (2021)Sorting Parity Encodings by Reusing Variables., and . SAT, volume 12178 of Lecture Notes in Computer Science, page 1-10. Springer, (2020)Towards Uniform Certification in QBF., and . Log. Methods Comput. Sci., (2024)