雜志介紹

Computational Complexity雜志介紹

《Computational Complexity》是一本以English為主的未開放獲取國際優秀期刊，中文名稱計算復雜度，本刊主要出版、報道計算機科學-COMPUTER SCIENCE, THEORY & METHODS領域的研究動態以及在該領域取得的各方面的經驗和科研成果，介紹該領域有關本專業的最新進展，探討行業發展的思路和方法，以促進學術信息交流，提高行業發展。該刊已被國際權威數據庫SCIE收錄，為該領域相關學科的發展起到了良好的推動作用，也得到了本專業人員的廣泛認可。該刊最新影響因子為0.7，最新CiteScore 指數為1.5。

本刊近期中國學者發表的論文主要有：

• Tradeoff lower lounds for stack machines

  Author: Matei David, Periklis A. Papakonstantinou

英文介紹

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.