verified SJR 0,85 · Q1 • database Scopus / SJR & Web of Science indexed

United States · Academic Press Inc.

workspace_premium Q1 — Statistics and Probability lock_open Open Access Unclaimed

Journal of Complexity

Journal of Complexity is a journal indexed in SJR in Statistics and Probability and Applied Mathematics with an H index of 57. It has an SJR impact factor of 0,85 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,85.

ISSN: 0885-064X

Editorial: Academic Press Inc.

Category: Statistics and Probability

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,85 Q1

H-index 57

Tasa de Aceptación pie_chart

30% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

NPD Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,85

H-index

Docs (year)

Docs 3y

121

Total refs

1364

Cites 3y

235

Citable 3y

120

Cites/Doc 2y

1.78

Ref/Doc

31.72

Immediate OA

—

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

Applicability of Smolyak's Algorithms to Certain Banach Spaces of Multivariate Functions

Z8-Kerdock codes and pseudorandom binary sequences

Complexity of fixed points, I

Complexity of approximation with relative error criterion in worst, average, and probabilistic settings

Complete on Average Boolean Satisfiability

Classical and quantum function reconstruction via character evaluation

Can we approximate zeros of functions with nonzero topological degree?

Bifurcations of limit cycles from Quintic Hamiltonian systems with a double figure eight loop

Average-case complexity without the black swans

Average complexity for linear operators over bounded domains

Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result

Asymptotic error of algorithms for solving nonlinear problems

SHOW MORE ARTICLES

Approximation of smooth periodic functions in several variables

2001 Best Paper Award

An optimal recovery view of Walsh's equiconvergence theorem

An information-based approach to III-posed problems

Algorithmic and complexity issues of robot motion in an uncertain environment

Algebraic complexities and algebraic curves over finite fields

A simple proof to the minimum distance of Z4-linear Goethals-like codes

A short biography of Harald Niederreiter

A note on the trade-off between sampling and quantization in signal processing

A note on E. Thiemard's algorithm to compute bounds for the star discrepancy

A note on a theorem of Blum, Shub, and Smale

A fast algorithm for the discrete laplace transformation

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.