1 – 6 of 6
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
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
Lifting with simple gadgets and applications to circuit and proof complexity
2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.24-30(
- 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
- 2016
-
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
- 2013
-
Mark
Pebble games, proof complexity, and time-space trade-offs
(
- Contribution to journal › Article
- 2012
-
Mark
On the virtue of succinct proofs : Amplifying communication complexity hardness to time-space trade-offs in proof complexity
2012) 44th Annual ACM Symposium on Theory of Computing, STOC '12 In Proceedings of the Annual ACM Symposium on Theory of Computing p.233-247(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding