- Pranav Bisht, Ilya Volkovich. On Solving Sparse Polynomial Factorization Related Problems. Computational Complexity, 34(1):7, June 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.
- Ján Pich. Learning algorithms from circuit lower bounds. Computational Complexity, 34(1):6, June 2025.
- François Le Gall. Correction: Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms. Computational Complexity, 34(1):5, June 2025.
- Vikraman Arvind, Pushkar S. Joglekar. On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Computational Complexity, 34(2):10, December 2025.
- Pavel Hrubes. Hard submatrices for non-negative rank and communication complexity. Computational Complexity, 34(2):9, December 2025.
- Supartha Podder, Penghui Yao, Zekun Ye. On the Fine-Grained Query Complexity of Symmetric Functions. Computational Complexity, 34(1):3, June 2025.
- Md Lutfar Rahman, Thomas Watson 0001. Tractable Unordered 3-CNF Games. Computational Complexity, 34(2):12, December 2025.