| 8 | -- | 0 | Amey Bhangale, Subhash Khot, Dor Minzer. On approximability of Satisfiable k-CSPs: I |
| 9 | -- | 0 | Pavel Hrubes. Hard submatrices for non-negative rank and communication complexity |
| 10 | -- | 0 | Vikraman Arvind, Pushkar S. Joglekar. On Efficient Noncommutative Polynomial Factorization via Higman Linearization |
| 11 | -- | 0 | Yupan Liu. Quantum state testing beyond the polarizing regime and quantum triangular discrimination |
| 12 | -- | 0 | Md Lutfar Rahman, Thomas Watson 0001. Tractable Unordered 3-CNF Games |
| 13 | -- | 0 | Edward Pyne. Derandomizing Logspace With a Small Shared Hard Drive |
| 14 | -- | 0 | Andris Ambainis, Aleksandrs Belovs. An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree |
| 15 | -- | 0 | Dieter van Melkebeek, Nicollas M. Sdroievski. Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols |
| 16 | -- | 0 | Noel Arteche, Gaia Carenini, Matthew Gray. 0-Frege Is LWE-Hard |
| 17 | -- | 0 | Tsun Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley. Separation of the Factorization Norm and Randomized Communication Complexity |
| 18 | -- | 0 | Yaroslav Alekseev, Yuval Filmus, Alexander V. Smal. Lifting Dichotomies |
| 19 | -- | 0 | Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001. On a Hierarchy of Spectral Isomorphism Invariants |
| 20 | -- | 0 | Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan. Pseudo-Deterministic Query Complexity of Search Problems |