computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case Specific areas of concentration include: Structure of complexity classes (reductions, relativization questions, degrees, derandomization) Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations) Interactive proofs, pseudorandom generation, and randomness extraction Complexity issues in: learning theory number theory logic (complexity of logical theories, cost of decision procedures) combinatorial optimization and approximate Solutions distributed computing property testing
计算复杂性是计算复杂性领域的一个重要研究课题。其学科处于数学与理论计算机科学的结合点，具有清晰的数学轮廓和严格的数学格式。 中心议题包括: 计算模型、复杂性边界(特别强调下界)、复杂性类、权衡结果 用于顺序和并行计算 用于“一般”(布尔型)和“结构化”计算(例如决策树、算术电路) 用于确定性、概率性和非确定性计算 最坏情况和平均情况 具体的集中领域包括: 复杂性类的结构(约简、相对化问题、程度、去道德化) 代数复杂度(双线性复杂度，多项式、群、代数和表示的计算) 交互证明、伪随机生成和随机抽取 复杂性问题: 学习理论 数论 逻辑(逻辑理论的复杂性，决策过程的成本) 组合优化和近似解 分布式计算 性能测试
|
期刊ISSN
|
1016-3328 |
|
最新的影响因子
|
1.4 |
|
最新CiteScore值
|
0.95 |
|
最新自引率
|
15.80% |
|
期刊官方网址
|
http://link.springer.com/journal/37 |
|
期刊投稿网址
|
|
|
通讯地址
|
BIRKHAUSER VERLAG AG, VIADUKSTRASSE 40-44, PO BOX 133, BASEL, SWITZERLAND, CH-4010 |
|
偏重的研究方向（学科）
|
数学-计算机：理论方法 |
|
出版周期
|
Quarterly |
|
平均审稿速度
|
>12周，或约稿 |
|
出版年份
|
0 |
|
出版国家/地区
|
SWITZERLAND |
|
是否OA
|
No |
|
SCI期刊coverage
|
Science Citation Index Expanded（科学引文索引扩展） |
|
NCBI查询
|
PubMed Central (PMC)链接 全文检索(pubmed central) |
|
最新中科院JCR分区
|
大类(学科)
小类(学科)
JCR学科排名
数学
COMPUTER SCIENCE, THEORY & METHODS(计算机科学，理论和方法) 4区
MATHEMATICS(数学) 4区
95/103
244/310
|
|||||||
|
最新的影响因子
|
1.4 | |||||||
| 最新公布的期刊年发文量 |
|
|||||||
| 总被引频次 | 641 | |||||||
| 特征因子 | 0.001140 | |||||||
| 影响因子趋势图 |
2007年以来影响因子趋势图（整体平稳趋势）
|
|||||||
|
最新CiteScore值
|
0.95
=
引文计数(2018)
文献(2015-2017)
=
52次引用
55篇文献
|
||||||||||
| 文献总数（2014-2016） | 55 | ||||||||||
|
被引用比率
|
53% | ||||||||||
|
SJR
|
0.381 | ||||||||||
|
SNIP
|
0.991 | ||||||||||
|
CiteScore排名
|
|
||||||||||
| CiteScore趋势图 |
CiteScore趋势图
|
||||||||||
| scopus涵盖范围 |
scopus趋势图
|
||||||||||
|
本刊同领域相关期刊
|
|
| 期刊名称 | IF值 |
| THEORY OF COMPUTING SYSTEMS | 0.5 |
| ASTERISQUE | 1.1 |
| POSITIVITY | 1 |
| COMBINATORICA | 1.1 |
| ACTA NUMERICA | 14.2 |
| SEMIGROUP FORUM | 0.7 |
| ACTA ARITHMETICA | 0.7 |
| ACTA MATHEMATICA | 3.7 |
| ARS COMBINATORIA | 0.263 |
|
本刊同分区等级的相关期刊
|
|
| 期刊名称 | IF值 |
| THEORY OF COMPUTING SYSTEMS | 0.5 |
| COMPUTATIONAL COMPLEXITY | 1.4 |
| Reports on Mathematical Logic | 0.071 |
| Notre Dame Journal of Formal Logic | 0.7 |
| 分享者 | 点评内容 |
