| Publication | Date of Publication | Type |
|---|
| Intersection classes in TFNP and proof complexity | 2025-11-04 | Paper |
| Separations in proof complexity and TFNP | 2025-08-15 | Paper |
| Amortized circuit complexity, formal complexity measures, and catalytic algorithms | 2025-08-13 | Paper |
| KRW composition theorems via lifting | 2025-08-12 | Paper |
| Lifting with simple gadgets and applications to circuit and proof complexity | 2025-08-12 | Paper |
| Random ( n)-CNFs are hard for cutting planes | 2025-08-06 | Paper |
| Exponential lower bounds for monotone span programs | 2025-08-06 | Paper |
| Average case lower bounds for monotone switching networks | 2025-05-20 | Paper |
Separations in proof complexity and TFNP
Journal of the ACM | 2025-04-25 | Paper |
| Colourful TFNP and propositional proofs | 2024-11-19 | Paper |
| On low-end obfuscation and learning | 2024-09-25 | Paper |
| Further collapses in TFNP | 2024-07-05 | Paper |
Further collapses in \(\mathsf{TFNP}\)
SIAM Journal on Computing | 2024-05-24 | Paper |
KRW composition theorems via lifting
Computational Complexity | 2024-05-22 | Paper |
| scientific article; zbMATH DE number 7829297 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829301 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829302 (Why is no real title available?) | 2024-04-09 | Paper |
On the power and limitations of branch and cut
(available as arXiv preprint) | 2023-07-12 | Paper |
The proof complexity of SMT solvers
Computer Aided Verification | 2023-05-05 | Paper |
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
Journal of the ACM | 2023-04-27 | Paper |
| Lower Bounds for (Non-Monotone) Comparator Circuits | 2023-02-03 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
(available as arXiv preprint) | 2022-07-27 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
Computational Complexity | 2021-07-14 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
Computational Complexity | 2021-07-14 | Paper |
Stabbing planes
(available as arXiv preprint) | 2021-06-15 | Paper |
Lifting Nullstellensatz to monotone span programs over any field
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Strongly exponential lower bounds for monotone computation
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Path Graphs, Clique Trees, and Flowers | 2015-05-28 | Paper |
