verified SJR 1,103 · Q1 • database Scopus / SJR & Web of Science indexed

Switzerland · Birkhauser Verlag Basel

workspace_premium Q1 — Mathematics (miscellaneous) lock_open Open Access

computational complexity

computational complexity is a journal indexed in SJR in Mathematics (miscellaneous) and Computational Theory and Mathematics with an H index of 43. It has a price of 2290 €. It has an SJR impact factor of 1,103 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,103.

ISSN: 1016-3328

Publisher: Birkhauser Verlag Basel

Category: Mathematics (miscellaneous)

Indexation: verifiedScopus / SJR verifiedWeb of Science

open_in_new Portal NPD menu_book Guidelines NPD

schedule CountryOfPapers database fields

SJR Impact Factor trending_up

1,103 Q1

H-index 43

Acceptance rate pie_chart

33%

Source Acceptance_Rate

Time to publication hourglass_top

NPD

Field NPD

Publication cost (APC) payments

2.290 € Open Access

Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

1,103

H-index

Docs (year)

Docs 3y

Total refs

404

Cites 3y

Citable 3y

Cites/Doc 2y

1.17

Ref/Doc

31.08

Immediate OA

2290 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims

rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Circuits constructed with MOD q gates cannot compute ?AND? in sublinear size

When do extra majority gates help? Polylog (N) majority gates are equivalent to one

Counting curves and their projections

Correction to: Query-to-Communication Lifting for PNP

Constructions of Low-degree and Error-Correcting e-Biased Generators

Computing Frobenius maps and factoring polynomials

COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS

Complex polynomials and circuit lower bounds for modular counting

Communication Complexity Under Product and Nonproduct Distributions

Communication complexity towards lower bounds on circuit depth

Collecting coupons on trees, and the cover time of random walks

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes

SHOW MORE ARTICLES

Circuits on cylinders

"Errata for: ""On randomized one-round communication complexity"

Circuits and multi-party protocols

BPP has subexponential time simulations unlessEXPTIME has publishable proofs

An average complexity measure that yields tight hierarchies

All Natural NP-Complete Problems Have Average-Case Complete Versions

Algorithmic properties of maximal orders in simple algebras over Q

Affine extractors over large fields with exponential error

A lower bound for randomized algebraic decision trees

A complexity gap for tree resolution

A Complexity Dichotomy For Hypergraph Partition Functions

A characterization of span program size and improved lower bounds for monotone span programs

FAQs

computational complexity has an SJR of 1,103 (best quartile Q1) in the CountryOfPapers database.

Immediate OA APC is 2290 EUR. Non-OA / submission fee is 0 EUR.

The acceptance rate recorded for computational complexity is 33%.

computational complexity

Metrics

Name good journals. Call out predatory ones.

Researcher reviews

Best articles by citations

FAQs

What is the SJR of computational complexity?

What is the APC / publication cost?

What is the acceptance rate?