ISSN: 0885-064X

Journal Home

Journal Guideline

Journal of Complexity Q1 Unclaimed

Academic Press Inc. United States

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Algebra and Number Theory (Q1) Mathematics (miscellaneous) (Q1) Applied Mathematics (Q2) Control and Optimization (Q2) Numerical Analysis (Q2) Statistics and Probability (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,794

SJR Impact factor

54

H Index

41

Total Docs (Last Year)

112

Total Docs (3 years)

1364

Total Refs

197

Total Cites (3 years)

110

Citable Docs (3 years)

1.96

Cites/Doc (2 years)

33.27

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Annals of Mathematics Q1
Journal of Business and Economic Statistics Q1
Annals of Statistics Q1
Journal of the Royal Statistical Society. Series B: Statistical Methodology Q1
Annual Review of Statistics and Its Application Q1

Compare this journals

Aims and Scope

Best articles by citations

On the linear complexity profile of some new explicit inversive pseudorandom numbers

Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points

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

s-Perfect splines and their application to optimal recovery problems

Random problems

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

On invariance of degree for certain computations

On sequential and parallel solution of initial value problems

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

An information-based approach to III-posed problems

On the asymptotic behavior of the projective rescaling algorithm for linear programming

The covering number in learning theory

SHOW MORE ARTICLES

Some informational requirements for convergence

Optimal algorithms: Tools for mathematical modeling

Information-based numerical practice

The power of various real-valued quantum queries

On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints

The Price of Pessimism for Multidimensional Quadrature

P=NP for some structures over the binary words

Discontinuity detection from band-limited signals

On counting and generating curves over small finite fields

On average case complexity of linear problems with noisy information

On maximum length convolutional codes under a trellis complexity constraint

Algorithmic and complexity issues of robot motion in an uncertain environment