Academic Journal
Q2Computational Complexity
About Computational Complexity
Computational Complexity is a scholarly journal published by Springer International Publishing. SCImago 2025 lists it in Q2, with an SJR of 0.537 and H-index of 45.
Coverage: 1991-1996, 1998-2026. Research categories: Computational Mathematics (Q2); Computational Theory and Mathematics (Q2); Mathematics (miscellaneous) (Q2); Theoretical Computer Science (Q2).
Verified field sources
- Journal Impact Factor: 1.0 — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
- Impact Factor year: 2024 — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
- Editor(s): Markus Bläser (Editor-in-Chief) — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
Source-backed journal facts
Topics in published research
Complexity and Algorithms in Graphs; Cryptography and Data Security; Computability, Logic, AI Algorithms; Advanced Graph Theory Research; Machine Learning and Algorithms; semigroups and automata theory.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,090.00 USD; 2,490.00 EUR; 2,190.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
A Technique for Hardness Amplification Against $$\textsf{AC}^0$$
William M. Hoza
2026-12 · DOI: 10.1007/s00037-026-00296-9On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang et al.
2026-12 · DOI: 10.1007/s00037-026-00294-xSpecial Issue “Computational Complexity Conference 2023” Guest Editors’ Foreword
François Le Gall, Amnon Ta-Shma
2026-12 · DOI: 10.1007/s00037-026-00293-yBaby PIH: Parameterized Inapproximability of Min CSP
Venkatesan Guruswami, Xuandi Ren, Sai Sandeep
2026-12 · DOI: 10.1007/s00037-026-00291-0On the Composition of Randomized Query Complexity and Approximate Degree
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar et al.
2026-12 · DOI: 10.1007/s00037-026-00292-zTensor reconstruction beyond constant rank
Shir Peleg, Amir Shpilka, Ben Lee Volk
2026-12 · DOI: 10.1007/s00037-026-00295-wOn the Existence of Algebraic Natural Proofs
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi et al.
2026-12 · DOI: 10.1007/s00037-026-00289-8From amortized to worst case delay in enumeration algorithms
Florent Capelli, Yann Strozecki
2026-12 · DOI: 10.1007/s00037-026-00287-wOn Approximate Symmetric Polynomials and Tightness of Homogenization Results
Amir Shpilka
2026-06 · DOI: 10.1007/s00037-026-00286-xA strong direct sum theorem for distributional query complexity
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan et al.
2026-06 · DOI: 10.1007/s00037-026-00285-yTowards Optimal Depth-Reductions for Algebraic Formulas
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan et al.
2026-06 · DOI: 10.1007/s00037-025-00283-6Tight Quantum Lower Bound for Approximate Counting with Quantum States
Aleksandrs Belovs, Ansis Rosmanis
2026-06 · DOI: 10.1007/s00037-025-00282-7Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
Greta Panova
2026-06 · DOI: 10.1007/s00037-025-00281-8Pseudo-Deterministic Query Complexity of Search Problems
Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan
2025-12 · DOI: 10.1007/s00037-025-00266-7On a Hierarchy of Spectral Isomorphism Invariants
V. Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky et al.
2025-12 · DOI: 10.1007/s00037-025-00270-xLifting Dichotomies
Yaroslav Alekseev, Yuval Filmus, Alexander V. Smal
2025-12 · DOI: 10.1007/s00037-025-00276-5Quantum Automating TC0-Frege Is LWE-Hard
Noel Arteche, Gaia Carenini, Matthew Gray
2025-12 · DOI: 10.1007/s00037-025-00271-wSeparation of the Factorization Norm and Randomized Communication Complexity
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley et al.
2025-12 · DOI: 10.1007/s00037-025-00278-3Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols
Dieter van Melkebeek, Nicollas Mocelin Sdroievski
2025-12 · DOI: 10.1007/s00037-025-00279-2An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
Andris Ambainis, Aleksandrs Belovs
2025-12 · DOI: 10.1007/s00037-025-00277-4Reviews
Community Reviews
Version History
October 2, 2026 at 9:21 pm
October 2, 2026