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
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
-
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
- 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
- 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
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
(2015) 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015-December. p.466-485
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
The Parity of Directed Hamiltonian Cycles
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2010
-
Mark
Determinant sums for undirected Hamiltonicity
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Computing the Tutte polynomial in vertex-exponential time
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Short proofs may be spacious : An optimal separation of space and length in resolution
(2008) 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.709-718
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
