COMPUT COMPLEX 润色咨询

COMPUTATIONAL COMPLEXITY

出版年份:暂无数据 年文章数:489 投稿命中率: 开通期刊会员,数据随心看

出版周期:Quarterly 自引率:15.8% 审稿周期: 开通期刊会员,数据随心看

前往期刊查询

投稿信息

投稿信息
审稿费用
暂无数据
版面费用
暂无数据
中国人发表比例
2019年中国人文章占该期刊总数量暂无数据 (2018年为暂无数据)
自引率
15.8 %
年文章数
489
期刊官网
点击查看 (点击次数:2834)
作者需知
暂无数据
偏重的研究方向
暂无数据
期刊简介
稿件收录要求
Computational Complexity (CC) 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 complexity classes trade-off results - for sequential and parallel computation - for «general» (Boolean) and «structured» computation - for deterministic probabilistic and nondeterministic computation Specific areas of concentration include: Structure of complexity classes Algebraic complexity Cryptography interactive proofs Complexity issues in - computational geometry robotics and motion planning - learning theory - number theory - logic - combinatorial optimization and approximate solutions - distributed computing