1 – 3 of 3
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Clique Is Hard on Average for Unary Sherali-Adams
2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.12-25(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.1-11(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 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