21 – 30 of 73
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
- Contribution to journal › Article
-
Mark
Proof complexity and SAT solving
(2021) p.233-350
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
The power of negative reasoning
(2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
- Contribution to journal › Article
- 2020
-
Mark
Using Resolution Proofs to Analyse CDCL Solvers
(2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.427-444
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
(2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.917-934
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
(2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.338-357
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
(2020) 20th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 p.194-204
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
(2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Simplified and Improved Separations Between Regular and General Resolution by Lifting
(2020) 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 In Lecture Notes in Computer Science 12178. p.182-200
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
