1 – 5 of 5
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2024
-
Mark
KRW Composition Theorems via Lifting
(
- Contribution to journal › Article
- 2020
-
Mark
Lifting with simple gadgets and applications to circuit and proof complexity
2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.24-30(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
KRW composition theorems via lifting
2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.43-49(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Bounds for semi-disjoint bilinear forms in a unit-cost computational model
2017) 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 LNCS. p.412-424(
- 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