( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dataset of Random Reordered Encodings of Parity Problems.

, , , и . (декабря 2023)

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.

William Chew

Wakene Negassa Chewaka

Esther Leroy

Antoine Leroy

Herbert Leroy

 

Другие публикации лиц с тем же именем

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., , , и . AAAI, стр. 7978-7986. AAAI Press, (2024)How QBF Expansion Makes Strategy Extraction Hard., и . IJCAR (1), том 12166 из Lecture Notes in Computer Science, стр. 66-82. Springer, (2020)Short Proofs in QBF Expansion., , , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 19-35. Springer, (2019)Towards Uniform Certification in QBF., и . STACS, том 219 из LIPIcs, стр. 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Avoiding Monochromatic Rectangles Using Shift Patterns., , и . CoRR, (2020)Understanding Nullstellensatz for QBFs., , , и . 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., и . SAT, том 236 из LIPIcs, стр. 10:1-10:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hardness and Optimality in QBF Proof Systems Modulo NP.. SAT, том 12831 из Lecture Notes in Computer Science, стр. 98-115. Springer, (2021)