11 – 18 of 18
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- « previous
- 1
- 2
- next »
- 2020
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Nullstellensatz size-degree trade-offs from reversible pebbling
2019) 34th Computational Complexity Conference, CCC 2019 In Leibniz International Proceedings in Informatics, LIPIcs 137.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Clique is hard on average for regular resolution
2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 In Proceedings of the Annual ACM Symposium on Theory of Computing p.646-659(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Cumulative space in black-white pebbling and resolution
2017) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017 In Leibniz International Proceedings in Informatics, LIPIcs 67.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
2016) 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016-December. p.295-304(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
On the proper orientation number of bipartite graphs
(
- Contribution to journal › Article
- 2013
-
Mark
Intersecting longest paths
(
- Contribution to journal › Article
- 2011
-
Mark
Intersection of Longest Paths in a Graph
2011) Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011 In Electronic Notes in Discrete Mathematics 38. p.743-748(
- Contribution to journal › Article
- « previous
- 1
- 2
- next »