SCIESCOPUSQ2
COMPUTATIONAL COMPLEXITY
SPRINGER BASEL AG, Switzerland
COMPUTATIONAL COMPLEXITY is an academic journal published by SPRINGER BASEL AG (Switzerland). Identifiers: ISSN 1016-3328, eISSN 1420-8954. Indexed in SCIE, SCOPUS. Metrics: JIF 1.0, CiteScore 1.8, SJR 1.103, SNIP 1.42. Subject areas: COMPUTER SCIENCE, MATHEMATICS, THEORY & METHODS. tlooto lists 631 papers from this journal.
CiteScore
1.80
Scopus citation metric
SJR
1.103
SCImago rank
SNIP
1.42
Source normalized impact
Percentage rank
-
JIF percentile rank
Journal profile
- ISSN
- 1016-3328
- eISSN
- 1420-8954
- Abbreviation
- COMPUT COMPLEX
- Publisher
- SPRINGER BASEL AG
- Country
- Switzerland
Web of Science categories
SCIECOMPUTER SCIENCE, MATHEMATICS, THEORY & METHODS
Scopus ASJC categories
17032600 General Mathematics2605 Computational Mathematics2614 Theoretical Computer Science
Keywords
Computer Science, Theory & Methods | Mathematics
Papers in this journal
Recent papers
- A strong direct sum theorem for distributional query complexity
2026
- On Approximate Symmetric Polynomials and Tightness of Homogenization Results
2026
- On the Composition of Randomized Query Complexity and Approximate Degree
2026
- Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
2026
- On the Existence of Algebraic Natural Proofs
2026
Most cited papers
- The electrical resistance of a graph captures its commute and cover times
1989 · 761 citations
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
2003 · 573 citations
- On the degree of boolean functions as real polynomials
1992 · 535 citations
- Non-deterministic exponential time has two-prover interactive protocols
2005 · 502 citations
- A new recursion-theoretic characterization of the polytime functions
1992 · 479 citations