- 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.
- 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.
- Supartha Podder, Penghui Yao, Zekun Ye. On the Fine-Grained Query Complexity of Symmetric Functions. Computational Complexity, 34(1):3, June 2025.
- Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam. Barriers for rectangular matrix multiplication. Computational Complexity, 34(1):4, June 2025.
- Amey Bhangale, Subhash Khot, Dor Minzer. On approximability of Satisfiable k-CSPs: I. Computational Complexity, 34(2):8, December 2025.
- Dominik Scheder, John P. Steinberger. PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. Computational Complexity, 33(2):13, December 2024.
- Miroslav Rada, Michal Cerný, Ondrej Sokol. The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability. Computational Complexity, 33(2):8, December 2024.