COMPUTATIONAL COMPLEXITY 期刊简介
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:
crytography
learning theory
number theory
logic (complexity of logical theories, cost of decision procedures)
combinatorial optimization and approximate Solutions
distributed computing
property testing.
计算复杂性在计算复杂性方面提出了杰出的研究。它的主题是数学和理论计算机科学之间的接口,具有清晰的数学轮廓和严格的数学格式。
中心主题是:
计算模型,复杂性边界 (特别强调下限),复杂性类,权衡结果
对于顺序和并行计算
对于 “一般” (布尔) 和 “结构化” 计算 (例如决策树,算术电路)
对于确定性,概率,和非确定性计算
最坏情况和平均情况
特定的集中领域包括:
复杂度类的结构 (约简,相对化问题,度,去随机化)
代数复杂度 (双线性复杂度,多项式,群,代数,和表示)
交互式证明,伪随机生成和随机性提取
复杂性问题:
crytography
学习理论
数论
逻辑 (逻辑理论的复杂性,决策程序的成本)
组合优化和近似解
分布式计算
属性测试。
期刊ISSN
|
1016-3328 |
影响指数
|
1.339 |
最新CiteScore值
|
3.20 查看CiteScore评价数据 |
最新自引率
|
4.40% |
官方指定润色网址
|
https://www.deeredit.com/?type=ss1 |
投稿语言要求
|
Improve the quality of the paper, eliminate grammar and spelling errors, increase readability, ensure accurate communication of viewpoints, enhance academic reputation, and increase the chances of the paper being accepted. 建议点击这个网址:https://www.deeredit.com/?type=ss2,资深审稿专家为您评估稿件质量,提供针对性改进建议,最终可助您极大提升目标期刊录用率 |
期刊官方网址
hot |
https://www.peipusci.com/?type=9 |
杂志社征稿网址
hot |
https://www.peipusci.com/?type=10 |
通讯地址
|
BIRKHAUSER VERLAG AG, VIADUKSTRASSE 40-44, PO BOX 133, BASEL, SWITZERLAND, CH-4010 |
偏重的研究方向(学科)
|
数学-计算机:理论方法 |
出版周期
|
Quarterly |
出版年份
|
1991 |
出版国家/地区
|
SWITZERLAND |
是否OA
|
No |
SCI期刊coverage
|
Science Citation Index Expanded(科学引文索引扩展) |
NCBI查询
|
PubMed Central (PMC)链接 全文检索(pubmed central) |
最新中科院JCR分区
|
大类(学科)
小类(学科)
综述期刊
工程技术
COMPUTER SCIENCE, THEORY & METHODS(计算机:理论方法)4区
MATHEMATICS(数学)4区
否
|
|||||
最新的影响因子
|
1.339 | |||||
最新公布的期刊年发文量 |
|
|||||
总被引频次 | 33 | |||||
影响因子趋势图 |
近年的影响因子趋势图(整体平稳趋势)
|
2022年预警名单预测最新
最新CiteScore值
|
3.20
|
||||||||||||||||||||||
年文章数 | 8 | ||||||||||||||||||||||
SJR
|
0.973 | ||||||||||||||||||||||
SNIP
|
1.417 | ||||||||||||||||||||||
CiteScore排名
|
|
||||||||||||||||||||||
CiteScore趋势图 |
CiteScore趋势图
|
本刊同领域相关期刊
|
|
期刊名称 | IF值 |
JOURNAL OF COMPLEXITY | 1.383 |
THEORY OF COMPUTING SYSTEMS | 0.576 |
JOURNAL OF GEOMETRY AND PHYSICS | 1.237 |
CALCOLO | 2.135 |
Filomat | 0.836 |
ASTERISQUE | 1.503 |
POSITIVITY | 1.02 |
MATHEMATIKA | 0.836 |
COMBINATORICA | 1.054 |
本刊同分区等级的相关期刊
|
|
期刊名称 | IF值 |
THEORY OF COMPUTING SYSTEMS | 0.576 |
JOURNAL OF GEOMETRY AND PHYSICS | 1.237 |
Filomat | 0.836 |
MATHEMATIKA | 0.836 |
SEMIGROUP FORUM | 0.76 |
ACTA ARITHMETICA | 0.602 |
ARS COMBINATORIA | 0.26 |
Open Mathematics | 0.953 |
RAMANUJAN JOURNAL | 0.829 |
分享者 | 点评内容 |