11 – 20 of 33
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 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
Cumulative space in black-white pebbling and resolution
2017) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017 In Leibniz International Proceedings in Informatics, LIPIcs 67.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
- 2016
-
Mark
Supercritical space-width trade-offs for resolution
2016) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 In Leibniz International Proceedings in Informatics, LIPIcs 55.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
2016) 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016-December. p.295-304(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow proofs may be maximally long
(
- Contribution to journal › Article
- 2015
-
Mark
A generalized method for proving polynomial calculus degree lower bounds
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.467-487(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
From small space to small width in resolution
(
- Contribution to journal › Article