1 – 5 of 5
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
Trade-offs between size and degree in polynomial calculus
2020) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 In Leibniz International Proceedings in Informatics, LIPIcs 151.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Narrow proofs may be maximally long
(
- 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
From small space to small width in resolution
(
- Contribution to journal › Article
-
Mark
Space complexity in polynomial calculus
(
- Contribution to journal › Article