From post

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.

 

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

Proving Unsatisfiability with Hitting Formulas., , , , и . ITCS, том 287 из LIPIcs, стр. 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , и . FOCS, стр. 24-30. IEEE, (2020)Hard Examples for Common Variable Decision Heuristics.. AAAI, стр. 1652-1659. AAAI Press, (2020)Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers., , , , и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 233-249. Springer, (2020)Limits of CDCL Learning via Merge Resolution., , , , и . SAT, том 271 из LIPIcs, стр. 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Proving Unsatisfiability with Hitting Formulas., , , , и . CoRR, (2023)Irreducible subcube partitions., , , , , , и . CoRR, (2022)Hardness of Approximation in PSPACE and Separation Results for Pebble Games., , , и . CoRR, (2023)Equality Alone Does Not Simulate Randomness., , и . Electron. Colloquium Comput. Complex., (2018)On the Hierarchical Community Structure of Practical SAT Formulas., , , , , , , и . CoRR, (2021)