Computational Complexity
Impact Factor Trend (2018–2026)
Clarivate IF trend for Computational Complexity
SCImago Journal Rank citation prestige weighting
45 papers with at least that number of citations each
Aims & Scope
computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case Specific areas of concentration include: Structure of complexity classes (reductions, relativization questions, degrees, derandomization) Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations) Interactive proofs, pseudorandom generation, and randomness extraction Complexity issues in: crytography learning theory number theory logic (complexity of logical theories, cost of decision procedures) combinatorial optimization and approximate Solutions distributed computing property testing.
Special Issues
Calls for PapersNo active Calls for Papers found for this journal.
WoS Categories & Quartiles
Detailed JCR / JCI category rankings and quartile breakdown from Clarivate
COMPUTER SCIENCE, THEORY & METHODS
MATHEMATICS
COMPUTER SCIENCE, THEORY & METHODS
MATHEMATICS
Annual Historical Statistics & Publications
Track annual publication volume, total citations, and Impact Factor evolution
SCImago & Scopus Journal Intelligence
Global SCImago ranking, SJR prestige index, Scopus coverage, and societal policy impact
Weighted prestige citation metric per document indexed in the Scopus database.
Average citations received per document published in the 2-year window.
Estimated Article Processing Charge for Open Access publication.
Scopus 3-Year Publication & Citation Window
Aggregated from Scopus database across the 3-year SJR evaluation window.
Societal Impact & Inclusivity (SCImago)
Citations in government and international policy documents
Percentage of female authors published in the journal
Real-world societal policy reach and author gender diversity tracked by SCImago.
Scopus Subject Categories
Journal Metrics & Citation Visualizations
Total Cites vs Self-Cites
Evaluation of scholarly independence and citation reach
Citations per Document
Citation metric windows across 2, 3, and 4 years
Chinese Academy of Sciences (CAS) Classification
Major / minor zone classification and CAS Early Warning List history
Academic Intelligence Overview & Context
ImpaQ AnalysisComputational Complexity (abbr: COMPUT COMPLEX, ISSN: 1016-3328) is a peer-reviewed international scholarly journal in the field of Mathematics, published by Springer International Publishing in Switzerland since 1991. The periodical holds a Journal Impact Factor (JIF) of 0.70, ranking in quartile Q4 of Web of Science (SCIE), a Scopus SJR indicator of 0.537 (Q2), an H-index of 45.
The journal enforces rigorous peer evaluation with a publication frequency of Quarterly, an annual output of approximately 14 scientific articles. In terms of accessibility and author fees, it operates under the Hybrid model with an estimated APC of $3,281 USD. It serves as a benchmark publication platform for academics, researchers, and doctoral candidates seeking global research visibility.
Publishing & Editorial Information
Detailed publisher, peer-review turnaround, and publication cycle specifications
Similar Journals in Discipline
Journals in the same research field with comparable impact metrics