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 resultsfor sequential and parallel computationfor "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits)for deterministic, probabilistic, and nondeterministic computationworst case and average caseSpecific 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 extractionComplexity issues in:crytographylearning theorynumber theorylogic (complexity of logical theories, cost of decision procedures)combinatorial optimization and approximate Solutionsdistributed computingproperty testing.

计算复杂性在计算复杂性方面提出了杰出的研究。它的主题是数学和理论计算机科学之间的接口，具有清晰的数学轮廓和严格的数学格式。中心主题是: 计算模型，复杂性边界 (特别强调下限)，复杂性类别，顺序计算和并行计算的折衷结果对于确定性计算，概率计算和非确定性计算的 “一般” (布尔) 和 “结构化” 计算 (例如决策树，算术电路) 最坏情况和平均特定集中区域包括: 复杂性类的结构 (减少，相对论问题，度，去随机化) 代数复杂性 (双线性复杂性，多项式，组，代数和表示的计算) 交互式证明，伪随机生成和随机性提取复杂性问题: crytographylearning定理数论逻辑 (逻辑理论的复杂性，决策程序的成本) 组合优化和近似解决方案分布式计算属性测试。

《COMPUTATIONAL COMPLEXITY》期刊已被查看：次

分区信息