ISSN: 1016-3328

Journal Home

Journal Guideline

computational complexity Q2 Unclaimed

Birkhauser Verlag Basel Switzerland

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

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Mathematics (miscellaneous) (Q2) Computational Mathematics (Q3) Computational Theory and Mathematics (Q3) Theoretical Computer Science (Q3)

Price

2290 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,453

SJR Impact factor

41

H Index

13

Total Docs (Last Year)

39

Total Docs (3 years)

487

Total Refs

26

Total Cites (3 years)

39

Citable Docs (3 years)

0.58

Cites/Doc (2 years)

37.46

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

Comptes Rendus Mathematique Q2
Journal of Approximation Theory Q2
Siberian Mathematical Journal Q2
Acta Mathematica Scientia Q2
Studia Mathematica Q2

Compare this journals

Aims and Scope

Best articles by citations

The quantifier structure of sentences that characterize nondeterministic time complexity

Lower bounds for testing triangle-freeness in Boolean functions

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

On the size of randomized OBDDs and read-once branching programs for k -stable functions

Correction to: Query-to-Communication Lifting for PNP

Homogeneous Formulas and Symmetric Polynomials

On the Approximation Resistance of a Random Predicate

On the hardness of approximating the permanent of structured matrices

Derandomizing Arthur--Merlin games under uniform assumptions

On the hardness of computing the permanent of random matrices

On the Structure of Boolean Functions with Small Spectral Norm

Lower bounds on arithmetic circuits via partial derivatives

SHOW MORE ARTICLES

On the degree of boolean functions as real polynomials

Straight-line programs and torsion points on elliptic curves

THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS

Space-Efficient Counting in Graphs on Surfaces

Vanishing of Littlewood-Richardson polynomials is in P

Homogenization and the polynomial calculus

Hardness Hypotheses, Derandomization, and Circuit Complexity

Selection problems viaM-ary queries

Randomness in interactive proofs

Computing Frobenius maps and factoring polynomials

Limits on Alternation Trading Proofs for Time-Space Lower Bounds

Limits on the Hardness of Lattice Problems in l p Norms