Journal of Complexity - Elsevier - Imppact Factor

Journal of Complexity - Elsevier | 2025 Impact Factor:1.7 | Cite Score:3.4 | SCOPUS Q1

Impact Factor and Journal Rank of Complexity

About: The Journal of Complexity publishes original research papers that focus on substantial mathematical results concerning complexity in a broad sense. The journal covers various aspects of computational complexity, particularly emphasizing complexity over the reals, with a strong focus on lower bounds and optimal algorithms. Additionally, the journal welcomes contributions that introduce significant new algorithms or make substantial progress on upper bounds. Other computational models, including the Turing machine model, are also within the scope of interest.
Publication Criteria
The Journal of Complexity upholds the following publication standards:
Originality and Quality: Articles must present high-quality original research.
Rigorous Review: Rigorous peer-review process to ensure scholarly integrity.
Broad Access: As an Open Access journal, ensuring broad accessibility to its published content.
Types of Articles Accepted
The journal accepts various types of contributions, including:
Research Papers: Original research presenting substantial mathematical results.
Review Articles: Comprehensive reviews providing a synthesis of current research in specific areas.
Algorithmic Advances: Articles introducing major new algorithms or significant improvements on existing algorithms.
Impact and Audience
The Journal of Complexity is impactful due to:
Broad Relevance: Contributions from a diverse range of disciplines, reflecting the interdisciplinary nature of complexity research.
Open Access: Facilitating widespread dissemination of research findings without access barriers.
Scholarly Rigor: Maintaining high standards of academic excellence and rigorous peer review.

Journal Home: Journal Homepage

Editor-in-Chief: Erich Novak

Scope: Journal of Complexity is a peer-reviewed journal that focuses on computational complexity and its applications across various disciplines. It publishes original research articles, surveys, and reviews that contribute to the understanding of complexity theory and its implications in science and engineering. The journal covers a wide range of topics related to complexity, including:
Complexity Theory: Fundamental aspects of computational complexity, including complexity classes, hardness and completeness, and other theoretical foundations.
Algorithmic Complexity: Analysis of algorithms in terms of their time complexity, space complexity, and their efficiency in solving complex problems.
Computational Geometry: Algorithms and complexity issues in computational geometry, including geometric data structures and geometric optimization problems.
Complex Systems: Study of complex systems and emergent behavior, including applications in physics, biology, economics, and social sciences.
Randomized Algorithms: Design and analysis of randomized algorithms for solving computational problems efficiently.
Parallel and Distributed Computing: Complexity issues in parallel and distributed computing systems, including parallel algorithms and complexity trade-offs.
Applications of Complexity Theory: Practical applications of complexity theory in various fields such as machine learning, optimization, cryptography, and network analysis.