雜志介紹

Computational Complexity雜志介紹

《Computational Complexity》是一本以English為主的未開(kāi)放獲取國(guó)際優(yōu)秀期刊，中文名稱(chēng)計(jì)算復(fù)雜度，本刊主要出版、報(bào)道計(jì)算機(jī)科學(xué)-COMPUTER SCIENCE, THEORY & METHODS領(lǐng)域的研究動(dòng)態(tài)以及在該領(lǐng)域取得的各方面的經(jīng)驗(yàn)和科研成果，介紹該領(lǐng)域有關(guān)本專(zhuān)業(yè)的最新進(jìn)展，探討行業(yè)發(fā)展的思路和方法，以促進(jìn)學(xué)術(shù)信息交流，提高行業(yè)發(fā)展。該刊已被國(guó)際權(quán)威數(shù)據(jù)庫(kù)SCIE收錄，為該領(lǐng)域相關(guān)學(xué)科的發(fā)展起到了良好的推動(dòng)作用，也得到了本專(zhuān)業(yè)人員的廣泛認(rèn)可。該刊最新影響因子為0.7，最新CiteScore 指數(shù)為1.5。

本刊近期中國(guó)學(xué)者發(fā)表的論文主要有：

• 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.