11 – 14 of 14
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- « previous
- 1
- 2
- next »
- 2013
-
Mark
Some trade-off results for polynomial calculus
2013) 45th Annual ACM Symposium on Theory of Computing, STOC 2013 In Proceedings of the Annual ACM Symposium on Theory of Computing p.813-822(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Pebble games, proof complexity, and time-space trade-offs
(
- Contribution to journal › Article
- 2012
-
Mark
Space complexity in polynomial calculus
2012) IEEE Computer Society Technical Committee on Mathematical Foundations of Computing In Proceedings of the Annual IEEE Conference on Computational Complexity p.334-344(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
- « previous
- 1
- 2
- next »