1 – 3 of 3
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2014
-
Mark
Narrow proofs may be maximally long
(2014) 29th Annual IEEE Conference on Computational Complexity, CCC 2014 In Proceedings of the Annual IEEE Conference on Computational Complexity p.286-297
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 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
- 2010
-
Mark
On the relative strength of pebbling and resolution
(2010) 25th Annual IEEE Conference on Computational Complexity, CCC 2010 In Proceedings of the Annual IEEE Conference on Computational Complexity p.151-162
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding