Computational Complexity
短名 | Comput. Complex. |
Journal Impact | 0.59 |
国际分区 | MATHEMATICS(Q2) |
期刊索引 | SCI Q1中科院 3 区 |
ISSN | 1016-3328, 1420-8954 |
h-index | 41 |
国内分区 | 计算机科学(3区)计算机科学计算机理论方法(3区)计算机科学数学(3区) |
计算复杂性提出了计算复杂性方面的杰出研究。它的主题是数学和理论计算机科学之间的接口,具有清晰的数学轮廓和严格的数学格式。中心主题是:计算模型、复杂性界限(特别强调下界)、复杂性类别、权衡结果用于确定性、概率性和非确定性计算的“一般”(布尔)和“结构化”计算(例如决策树、算术电路)的顺序和并行计算最坏情况和平均情况的具体重点领域包括:复杂性类别的结构(简化、相对化问题、度,去随机化)代数复杂性(双线性复杂性,多项式、组、代数和表示的计算)交互式证明、伪随机生成和随机性提取复杂性问题:密码学学习理论数论逻辑(逻辑理论的复杂性,决策过程的成本)组合优化和近似解分布式计算性能测试。
期刊主页投稿网址涉及主题 | 数学离散数学计算机科学组合数学算法数学分析物理程序设计语言理论计算机科学哲学量子力学纯数学几何学工程类生物上下界多项式的人工智能语言学计算复杂性理论 |
出版信息 | 出版商: Birkhauser Verlag Basel,出版周期: Quarterly,期刊类型: journal |
基本数据 | 创刊年份: 1998,原创研究文献占比: 100.00%,自引率:0.00%, Gold OA占比: 29.55% |
平均审稿周期 | 网友分享经验:>12周,或约稿 |
平均录用比例 | 网友分享经验:容易 |
期刊引文格式
这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Localizability of the approximation method
2024-9-5
Determinants vs. Algebraic Branching Programs
2024-8-31
Variety Evasive Subspace Families
2024-7-16
Combinatorial refinement on circulant graphs
2024-7-15
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
2024-7-3
Streaming approximation resistance of every ordering CSP
2024-5-29
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
2024-5-29
Limits of Preprocessing
2024-5-23
KRW Composition Theorems via Lifting
2024-4-29
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply $$\text{VP} \neq \text{VNP}$$
2024-4-16
On Blocky Ranks Of Matrices
2024-3-6
Approximating the chromatic polynomial is as hard as computing it exactly
2024-1-18
Improving $$3N$$ Circuit Complexity Lower Bounds
2023-12-1
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
2023-11-12
A Lower Bound on the Complexity of Testing Grained Distributions
2023-10-26
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
2023-9-13
Parallel algorithms for power circuits and the word problem of the Baumslag group
2023-9-13
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
2023-8-3
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations
2023-7-12
The Power of Natural Properties as Oracles
2023-7-6
Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?
2023-5-23
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
2023-5-17
Schur Polynomials Do Not Have Small Formulas If the Determinant does not
2023-5-13
Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q
2023-4-6
On sets of linear forms of maximal complexity
2022-11-29
Quantum versus Randomized Communication Complexity, with Efficient Players
2022-10-28
On Hitting-Set Generators for Polynomials that Vanish Rarely
2022-10-22
Improved Hitting Set for Orbit of ROABPs
2022-10-12
The Complexity of Finding Fair Independent Sets in Cycles
2022-10-11
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
2022-9-20
A Lower Bound on Determinantal Complexity
2022-9-19
Zeros and approximations of Holant polynomials on the complex plane
2022-7-27
A cost-scaling algorithm for computing the degree of determinants
2022-7-23
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
2022-7-5
Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond
2022-7-5
Improved bounds on the AN-complexity of $$O(1)$$-linear functions
2022-6-23
A quasi-linear irreducibility test in $$\mathbb{K}[[x]][y]$$
2022-6-1
Computing zero-dimensional tropical varieties via projections
2022-5-20
Expander-Based Cryptography Meets Natural Proofs
2022-3-16
Amplification with One NP Oracle Query
2022-2-5
The complexity of approximating the complex-valued Potts model
2022-2-3
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
2021-12-18
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
2021-11-17
Factorization of Polynomials Given by Arithmetic Branching Programs
2021-10-15
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
2021-10-8
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
2021-8-27
An Exponential Separation Between MA and AM Proofs of Proximity
2021-8-18
The hardest halfspace
2021-8-3
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
2021-7-2
Correction to: Smooth and Strong PCPs
2021-6-1
帮你贴心管理全部的文献
研飞ivySCI,高效的论文管理
投稿经验分享
分享我的经验,帮你走得更远