1 – 10 of 18
- 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
- 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
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
-
Mark
Automating Tree-Like Resolution in Time n^{o(log n)} Is ETH-Hard
2021) XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021 In Procedia Computer Science 195. p.152-162(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Automating algebraic proof systems is NP-hard
2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The power of negative reasoning
2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
(
- 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