Computational Complexity

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.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1
2024	0.70

Journal Rank

Year	Value
2024	4117

Journal Citation Indicator

Year	Value
2024	57

SJR (SCImago Journal Rank)

Year	Value
2024	1.103

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	43

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Non-deterministic exponential time has two-prover interactive protocols

  Citation: 372

  Authors: L�szl�, Lance, Carsten

• A new recursion-theoretic characterization of the polytime functions

  Citation: 239

  Authors: Spephen, Stephen

• Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds

  Citation: 236

  Authors: Valentine, Russell

• The electrical resistance of a graph captures its commute and cover times

  Citation: 226

  Authors: Ashok K., Prabhakar, Walter L., Roman, Prasoon

• BPP has subexponential time simulations unlessEXPTIME has publishable proofs

  Citation: 207

  Authors: L?szl�, Lance, Noam, Avi

• On the degree of boolean functions as real polynomials

  Citation: 199

  Authors: Noam, Mario

• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  Citation: 172

  Authors: Daniele

• Improved low-density subset sum algorithms

  Citation: 153

  Authors: Matthijs J., Antoine, Brian A., Andrew M., Claus-Peter, Jacques

• On the power of small-depth threshold circuits

  Citation: 137

  Authors: Johan, Mikael

• The hardness of approximation: Gap location

  Citation: 133

  Authors: Erez

---