Computational ComplexitySCIE

英文简介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.

期刊简介Computational Complexity期刊介绍

《Computational Complexity》自1991出版以来，是一本计算机科学优秀杂志。致力于发表原创科学研究结果，并为计算机科学各个领域的原创研究提供一个展示平台，以促进计算机科学领域的的进步。该刊鼓励先进的、清晰的阐述，从广泛的视角提供当前感兴趣的研究主题的新见解，或审查多年来某个重要领域的所有重要发展。该期刊特色在于及时报道计算机科学领域的最新进展和新发现新突破等。该刊近一年未被列入预警期刊名单，目前已被权威数据库SCIE收录，得到了广泛的认可。

该期刊投稿重要关注点：

• 预计审稿时间： 12周，或约稿
• 计算机科学
• COMPUTER SCIENCE, THEORY & METHODS
• SCIE
• 中科院3区
• 非预警