- Greta Panova. Polynomial time classical versus quantum algorithms for representation theoretic multiplicities. Computational Complexity, 35(1):1, June 2026.
- Aleksandrs Belovs, Ansis Rosmanis. Tight Quantum Lower Bound for Approximate Counting with Quantum States. Computational Complexity, 35(1):2, June 2026.
- Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan 0001, Sébastien Tavenas. Towards Optimal Depth-Reductions for Algebraic Formulas. Computational Complexity, 35(1):3, June 2026.
- Pranav Bisht, Ilya Volkovich. On Solving Sparse Polynomial Factorization Related Problems. Computational Complexity, 34(1):7, June 2025.
- Yaroslav Alekseev, Yuval Filmus, Alexander V. Smal. Lifting Dichotomies. Computational Complexity, 34(2):18, December 2025.
- François Le Gall. Robust Dequantization of the Quantum Singular Value Transformation and Quantum Machine Learning Algorithms. Computational Complexity, 34(1):2, 2025.
- Ninad Rajgopal, Rahul Santhanam. On the Structure of Learnability beyond P/poly. Computational Complexity, 34(1):1, June 2025.
- Yupan Liu. Quantum state testing beyond the polarizing regime and quantum triangular discrimination. Computational Complexity, 34(2):11, December 2025.
- Tsun Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley. Separation of the Factorization Norm and Randomized Communication Complexity. Computational Complexity, 34(2):17, December 2025.
- Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan. Pseudo-Deterministic Query Complexity of Search Problems. Computational Complexity, 34(2):20, December 2025.