1 – 10 of 57
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Certified Core-Guided MaxSAT Solving
2023) Proceedings of the 29th International Conference on Automated Deduction, CADE-29 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 14132 LNAI. p.1-22(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract)
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
(
- Contribution to journal › Article
-
Mark
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.1-11(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
2023) 29th International Conference on Principles and Practice of Constraint Programming, CP 2023(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2022
-
Mark
Certified CNF Translations for Pseudo-Boolean Solving
2022) 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) In Leibniz International Proceedings in Informatics (LIPIcs) 236.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
An Auditable Constraint Programming Solver
2022) 28th International Conference on Principles and Practice of Constraint Programming, CP 2022 In Leibniz International Proceedings in Informatics, LIPIcs 235.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
(
- Contribution to journal › Article
-
Mark
Learn to relax : Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
(
- Contribution to journal › Article
-
Mark
Automating algebraic proof systems is NP-hard
2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding