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區
• 非預警