1 – 10 of 16
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
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
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2018
-
Mark
Clique is hard on average for regular resolution
2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 In Proceedings of the Annual ACM Symposium on Theory of Computing p.646-659(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases
2017) 32nd Computational Complexity Conference, CCC 2017 In Leibniz International Proceedings in Informatics, LIPIcs 79.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Tight Size-Degree Bounds for Sums-of-Squares Proofs
(
- Contribution to journal › Article
-
Mark
CNFgen : A generator of crafted benchmarks
2017) 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 In Lecture Notes in Computer Science 10491. p.464-473(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Narrow proofs may be maximally long
(
- Contribution to journal › Article
-
Mark
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
2016) 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016 In Lecture Notes in Computer Science 9710. p.160-176(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
Tight size-degree bounds for sums-of-squares proofs
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.448-466(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
2015) 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015-December. p.466-485(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding