1 – 10 of 10
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
Supercritical space-width trade-offs for resolution
(
- 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
Narrow proofs may be maximally long
(
- Contribution to journal › Article
- 2015
-
Mark
From small space to small width in resolution
(
- Contribution to journal › Article
- 2014
-
Mark
From small space to small width in resolution
2014) 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 In Leibniz International Proceedings in Informatics, LIPIcs 25. p.300-311(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
- 2013
-
Mark
Pebble games, proof complexity, and time-space trade-offs
(
- Contribution to journal › Article
- 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
- 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