计较庞杂度 SCIE

期刊简介估计审稿时候： 12周，或约稿

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》(计较庞杂度)编辑部通信体例为BIRKHAUSER VERLAG AG, VIADUKSTRASSE 40-44, PO BOX 133, BASEL, SWITZERLAND, CH-4010。若是您须要辅佐投稿或润稿办事，您可以或许征询咱们的客服教员。咱们专一于期刊征询办事十年，熟习颁发政策，可为您供给一对一投稿指点，防止您在投稿时频仍碰鼻，节流您的可贵时候，有用晋升颁发机率，确保SCI检索（检索不了全额退款）。咱们视诺言为生命，多方面确保文章宁静失密，在任何环境下都不会泄漏您的小我信息或稿件内容。