- Igor Carboni Oliveira, Rahul Santhanam, Roei Tell. Expander-Based Cryptography Meets Natural Proofs. Computational Complexity, 31(1):4, 2022.
- Paul Görlach, Yue Ren, Leon Zhang. Computing zero-dimensional tropical varieties via projections. Computational Complexity, 31(1):5, 2022.
- Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos. The complexity of approximating the complex-valued Potts model. Computational Complexity, 31(1):2, 2022.
- Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura. Rank and border rank of Kronecker powers of tensors and Strassen's laser method. Computational Complexity, 31(1):1, 2022.
- Adrien Poteaux, Martin Weimann. A quasi-linear irreducibility test in 핂[[x]][y]. Computational Complexity, 31(1):6, 2022.
- Thomas Watson 0001. Amplification with One NP Oracle Query. Computational Complexity, 31(1):3, 2022.
- Tom Gur, Yang P. Liu, Ron D. Rothblum. An Exponential Separation Between MA and AM Proofs of Proximity. Computational Complexity, 30(2):12, 2021.
- Ben lee Volk, Mrinal Kumar 0001. Lower Bounds for Matrix Factorization. Computational Complexity, 30(1):6, 2021.
- Alexander A. Sherstov. The hardest halfspace. Computational Complexity, 30(2):11, 2021.
- Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov. Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Computational Complexity, 30(2):13, 2021.