1 – 10 of 10
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
(
- Contribution to journal › Article
- 2022
-
Mark
Lower bounds for Boolean circuits of bounded negation width
(
- Contribution to journal › Article
- 2021
-
Mark
Automating algebraic proof systems is NP-hard
2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Lower bounds for Demorgan circuits of bounded negation width
2019) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 In Leibniz International Proceedings in Informatics, LIPIcs 126.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps
2016) 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016 In Proceedings - Symposium on Logic in Computer Science 05-08-July-2016. p.267-276(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
Space complexity in polynomial calculus
(
- Contribution to journal › Article
- 2005
-
Mark
Unequal error protection explained by state-transition graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2002
-
Mark
Lower bounds for approximate polygon decomposition and minimum gap
(
- Contribution to journal › Article
-
Mark
Optimal graph exploration without good maps
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1996
-
Mark
Continuity and Positivity Problems in Pseudo-differential Calculus
1996)(
- Thesis › Doctoral thesis (monograph)