Explore All Access
Check if your research matches the topics covered in Computational Complexity?
- Degree of match
- Common matching concepts
- Additional journal recommendations
Computational Complexity : Impact Factor & More
eISSN: 1420-8954pISSN: 1016-3328
Share this on:
Check your submission readiness
Find out how your manuscript stacks up against 24 technical compliance and 6 language quality checks.
Computational Complexity Key Metrics
CiteScore 
3.1
SNIP
1.51
Computational Complexity Journal Specifications
| Overview | |
| Publisher | SPRINGER BASEL AG |
| Language | English |
| Frequency | Continuous publication |
| General Details | |
| Language | English |
| Frequency | Continuous publication |
| Publication Start Year | 1991 |
| Publisher URL | Visit website |
| Website URL | Visit website |
View less
Planning to publish in Computational Complexity ?
Upload your Manuscript to get
- Degree of match
- Common matching concepts
- Additional journal recommendations
Recently Published Papers in Computational Complexity
PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster
- 4 Nov 2024
- computational complexity
Localizability of the approximation method
- 5 Sep 2024
- computational complexity
Determinants vs. Algebraic Branching Programs
- 31 Aug 2024
- computational complexity
Variety Evasive Subspace Families
- 16 Jul 2024
- computational complexity
Combinatorial refinement on circulant graphs
- 15 Jul 2024
- computational complexity
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
- 3 Jul 2024
- computational complexity
PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster
- 4 Nov 2024
- computational complexity
Localizability of the approximation method
- 5 Sep 2024
- computational complexity
Determinants vs. Algebraic Branching Programs
- 31 Aug 2024
- computational complexity
Variety Evasive Subspace Families
- 16 Jul 2024
- computational complexity
Combinatorial refinement on circulant graphs
- 15 Jul 2024
- computational complexity
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
- 3 Jul 2024
- computational complexity
Compare Similar Journals with Computational Complexity
Select Journals to Compare with Computational Complexity
Total journals - 5
You can select up to 3 Journals at a time
SIAM Journal on Computing
Publisher: SIAM PUBLICATIONS
IEEE Transactions on Information Theory
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Lecture Notes in Computer Science
Publisher: Springer Nature
Theory of Computing
Publisher: UNIV CHICAGO, DEPT COMPUTER SCIENCE
Algorithmica
Publisher: SPRINGER
0 Journals Selected to compare with
Computational Complexity
Compare journals across 7 parameters SJR Ranking, Topics covered, Indexing Database, Publication Review Time, Publication Type, Article Processing Charges & Recently Published papers
SJR Ranking, Topics covered, Indexing Database, Publication Review Time, Publication Type, Article Processing Charges & Recently Published papers
Get detailed Journal comparison report on your email by signing up
FAQs on Computational Complexity
How long has Computational Complexity been actively publishing? 
Computational Complexity has been in operation since 1991 till date.
What is the publishing frequency of Computational Complexity?
Computational Complexity published with a Continuous publication frequency.
How many articles did Computational Complexity publish last year?
In 2023, Computational Complexity publsihed 12 articles.
What is the eISSN & pISSN for Computational Complexity?
For Computational Complexity, eISSN is 1420-8954 and pISSN is 1016-3328.
What is Citescore for Computational Complexity?
Citescore for Computational Complexity is 3.1.
What is SNIP score for Computational Complexity?
SNIP score for Computational Complexity is 1.51.
Who is the publisher of Computational Complexity?
SPRINGER BASEL AG is the publisher of Computational Complexity.
