| No. |
Title |
Author |
Year |
| 1 |
Colourful TFNP and Propositional Proofs |
Davis, Ben et al. |
2023 |
| 2 |
On Low-End Obfuscation and Learning |
Boyle, Elette et al. |
2023 |
| 3 |
Extremely Deep Proofs |
Fleming, Noah et al. |
2022 |
| 4 |
Further Collapses in TFNP |
Göös, Mika et al. |
2022 |
| 5 |
On Semi-Algebraic Proofs and Algorithms |
Fleming, Noah et al. |
2022 |
| 6 |
Pseudorandom Self-Reductions for NP-Complete Problems |
Elrazik, Reyad Abed et al. |
2022 |
| 7 |
On the Power and Limitations of Branch and Cut |
Fleming, Noah et al. |
2021 |
| 8 |
Lower Bounds for (Non-Monotone) Comparator Circuits |
Gál, Anna et al. |
2020 |
| 9 |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling |
de Rezende, Susanna F. et al. |
2019 |
| 10 |
Adventures in Monotone Complexity and TFNP |
Göös, Mika et al. |
2018 |
| 11 |
Stabbing Planes |
Beame, Paul et al. |
2018 |
