| 10 | -- | 0 | Toniann Pitassi, Morgan Shirley, Thomas Watson 0001. Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity |
| 11 | -- | 0 | Alexander A. Sherstov. The hardest halfspace |
| 12 | -- | 0 | Tom Gur, Yang P. Liu, Ron D. Rothblum. An Exponential Separation Between MA and AM Proofs of Proximity |
| 13 | -- | 0 | Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov. Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs |
| 14 | -- | 0 | Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre. Lower Bounds for Arithmetic Circuits via the Hankel Matrix |
| 15 | -- | 0 | Amit Sinhababu, Thomas Thierauf. Factorization of Polynomials Given by Arithmetic Branching Programs |
| 16 | -- | 0 | Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov. Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs |