Leroy Chew

Recent Publications

Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev and Stefan Szeider), volume 377 of LIPIcs, pages 11:1-11:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Better Extension Variables in DQBF via Independence
28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 11:1-11:24, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy and Sriraam Natarajan), pages 7978-7986, 2024, AAAI Press.
Towards Uniform Certification in QBF
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink and Benjamin Monmege), volume 219 of LIPIcs, pages 22:1-22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hardness and Optimality in QBF Proof Systems Modulo NP
2021, Technical report AC-TR-21-013, Algorithms and Complexity Group, TU Wien.