Overview
computational complexity offers outstanding research at the junction of mathematics and theoretical computer science.
- Covers models of computation, complexity bounds, complexity classes and more.
- Explores the structure of complexity classes, algebraic complexity, the role of randomness, issues in cryptography, robotics, logic and distributed computing.
- Clear mathematical profile and strictly mathematical format.
- Editor-in-Chief
-
- Peter Bürgisser
- Journal Impact Factor
- 0.7 (2023)
- 5-year Journal Impact Factor
- 1.0 (2023)
- Downloads
- 10,377 (2023)
Latest articles
Journal updates
-
Computational-Complexity Website
http://www.computational-complexity.org
Journal information
- Electronic ISSN
- 1420-8954
- Print ISSN
- 1016-3328
- Abstracted and indexed in
-
- ACM Digital Library
- BFI List
- Baidu
- CLOCKSS
- CNKI
- CNPIEC
- Current Contents/Engineering, Computing and Technology
- DBLP
- Dimensions
- EBSCO
- Google Scholar
- INSPEC
- INSPIRE
- Japanese Science and Technology Agency (JST)
- Mathematical Reviews
- Naver
- OCLC WorldCat Discovery Service
- Portico
- ProQuest
- SCImago
- SCOPUS
- Science Citation Index Expanded (SCIE)
- TD Net Discovery Service
- UGC-CARE List (India)
- Wanfang
- zbMATH
- Copyright information