1 – 9 of 9
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2017
-
Mark
Tight Size-Degree Bounds for Sums-of-Squares Proofs
(
- Contribution to journal › Article
- 2015
-
Mark
A generalized method for proving polynomial calculus degree lower bounds
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.467-487(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Tight size-degree bounds for sums-of-squares proofs
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.448-466(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Narrow proofs may be spacious : Separating space and width in resolution
(
- Contribution to journal › Article
- 2008
-
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
- 2007
-
Mark
Embedding point sets into plane graphs of small dilation
(
- 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
- 2005
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2002
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding