Journal Title：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.

計算復(fù)雜性展示了計算復(fù)雜性方面的杰出研究。其主題是數(shù)學(xué)和理論計算機科學(xué)的交叉學(xué)科，具有清晰的數(shù)學(xué)特征和嚴格的數(shù)學(xué)格式。

中心主題是：

計算模型、復(fù)雜度界限（特別強調(diào)下限）、復(fù)雜度類別、權(quán)衡結(jié)果

用于順序和并行計算

用于“一般”（布爾）和“結(jié)構(gòu)化”計算（例如決策樹、算術(shù)電路）

用于確定性、概率和非確定性計算

最壞情況和平均情況

具體集中領(lǐng)域包括：

復(fù)雜度類別的結(jié)構(gòu)（歸約、相對化問題、度數(shù)、去隨機化）

代數(shù)復(fù)雜度（雙線性復(fù)雜度、多項式、群、代數(shù)和表示的計算）

交互式證明、偽隨機生成和隨機性提取

復(fù)雜性問題：

密碼學(xué)

學(xué)習(xí)理論

數(shù)論

邏輯（邏輯理論的復(fù)雜性、決策程序的成本）

組合優(yōu)化和近似解

分布式計算

屬性測試。

Computational Complexity創(chuàng)刊于1991年，由Springer International Publishing出版商出版，收稿方向涵蓋數(shù)學(xué) - 計算機：理論方法全領(lǐng)域，此刊是中等級別的SCI期刊，所以過審相對來講不是特別難，但是該刊專業(yè)認可度不錯，仍然是一本值得選擇的SCI期刊 。平均審稿速度 12周，或約稿 ，影響因子指數(shù)0.7，該期刊近期沒有被列入國際期刊預(yù)警名單，廣大學(xué)者值得一試。