61 – 66 of 66
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 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
- 2009
-
Mark
A simplified way of proving trade-off results for resolution
(
- Contribution to journal › Article
-
Mark
Narrow proofs may be spacious : Separating space and width in resolution
(
- Contribution to journal › Article
- 2008
-
Mark
Short proofs may be spacious : An optimal separation of space and length in resolution
2008) 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.709-718(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Towards an optimal separation of space and length in resolution
2008) 40th Annual ACM Symposium on Theory of Computing, STOC 2008 In Proceedings of the Annual ACM Symposium on Theory of Computing p.701-710(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Narrow proofs may be spacious : Separating space and width in resolution
2006) 38th Annual ACM Symposium on Theory of Computing, STOC'06 In Proceedings of the Annual ACM Symposium on Theory of Computing 2006. p.507-516(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding