ACM Transactions on Computation Theory
| 短名 | ACM Trans. Comput. Theory |
| Journal Impact | 0.62 |
| 国际分区 | COMPUTER SCIENCE, THEORY & METHODS(Q3) |
| ISSN | 1942-3454, 1942-3462 |
| h-index | 20 |
| 涉及主题 | 数学计算机科学组合数学离散数学算法数学分析理论计算机科学程序设计语言物理哲学几何学纯数学上下界工程类图形统计认识论人工智能量子力学 |
| 出版信息 | 出版商: Association for Computing Machinery (ACM)，出版周期: ，期刊类型: journal |
| 基本数据 | 创刊年份: 2009，原创研究文献占比: 100.00%，自引率:0.00%， Gold OA占比: 2.13% |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths
2024-9-5
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
2024-9-5
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
2024-8-27
Planar #CSP Equality Corresponds to Quantum Isomorphism ? A Holant Viewpoint
2024-8-23
Bounding the communication complexity of fault-tolerant common coin tossing
2024-8-8
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
2024-8-8
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space
2024-7-11
Faster Counting and Sampling Algorithms using Colorful Decision Oracle
2024-6-10
Lower Bound for Independence Covering in <i>C</i> <sub>4</sub> -Free Graphs
2024-5-30
Structural Parameterizations for Two Bounded Degree Problems Revisited
2024-5-30
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
2024-5-23
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
2024-5-17
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms
2024-3-22
Small-Space Spectral Sparsification via Bounded-Independence Sampling
2024-3-14
Bounded Degree Nonnegative Counting CSP
2024-3-14
Hard QBFs for Merge Resolution
2024-3-14
Optimal Polynomial-Time Compression for Boolean Max CSP
2024-3-12
On <i>p</i> -Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors
2024-3-12
Quantum Communication Complexity of Linear Regression
2024-3-12
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems
2024-3-12
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
2024-3-1
On parity decision trees for Fourier-sparse Boolean functions
2024-2-13
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument
2024-1-24
Hard QBFs for Merge Resolution
2023-12-22
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
2023-12-12
Bounded Degree Nonnegative Counting CSP
2023-11-17
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems
2023-10-17
Quantum Communication Complexity of Linear Regression
2023-9-23
Sparsification Lower Bounds for List <i>H</i> -Coloring
2023-9-15
Parameterized Complexity of Feature Selection for Categorical Data Clustering
2023-9-1
Forgetfulness Can Make You Faster: An <b> <i>O</i> <sup>*</sup> (8.097 <sup> <i>k</i> </sup> ) </b> -time Algorithm for Weighted 3-set <b> <i>k</i> </b> -packing
2023-8-16
Catalytic Branching Programs from Groups and General Protocols
2023-5-17
Quantum Time–Space Tradeoff for Finding Multiple Collision Pairs
2023-4-13
On Protocols for Monotone Feasible Interpolation
2023-3-31
Constructing Faithful Homomorphisms over Fields of Finite Characteristic
2023-3-31
Inapproximability of Counting Hypergraph Colourings
2022-12-31
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
2022-12-31
Linearly Ordered Colourings of Hypergraphs
2022-12-31
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems
2022-12-31
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits
2022-6-30
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
2022-6-30
Point-hyperplane Incidence Geometry and the Log-rank Conjecture
2022-6-30
Planar Graph Isomorphism Is in Log-Space
2022-6-30
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error
2022-3-23
Approximate Degree, Weight, and Indistinguishability
2022-3-4
Quantum Distributed Complexity of Set Disjointness on a Line
2022-3-4
Erasure-Resilient Sublinear-Time Graph Algorithms
2021-12-15
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
2021-12-15
Counting Homomorphisms to Trees Modulo a Prime
2021-9-30
Complexity of Shift Bribery in Committee Elections
2021-9-30
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远