51 – 60 of 456
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 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
-
Mark
Simplified and Improved Separations Between Regular and General Resolution by Lifting
2020) 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 In Lecture Notes in Computer Science 12178. p.182-200(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
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
- 2019
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
-
Mark
Clearing directed subgraphs by mobile agents : Variations on covering with paths
(
- Contribution to journal › Article
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
Preface
2019) 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11651 LNCS.(
- Chapter in Book/Report/Conference proceeding › Preface to conference proceeding