EUVIMED · CrossrefJournal
ACM Transactions on Computation Theory
ISSN 1942-3454 · Association for Computing Machinery (ACM)
Latest articles
On the Hardness of Compressing Weights
Broadcasting Under Structural Restrictions
Lower Bounds for Symmetric Circuits for the Determinant
Multivariate Exploration of Metric Dilation
The Ideal Membership Problem and Abelian Groups
On the Complexity of Hazard-Free Formulas
Secret Sharing, Slice Formulas, and Monotone Real Circuits
Corrigendum: Lower Bounds for Planar Arithmetic Circuits
A Study of Distributional Complexity Measures for Boolean Functions
Optimal Polynomial-Time Compression for Boolean Max CSP
On the Power of Amortization in Secret Sharing
Search versus Decision for Election Manipulation Problems
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
(Leveled) Fully Homomorphic Encryption without Bootstrapping
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
Editor’s Foreword
Algebrization
A Simple Proof of Bazzi’s Theorem
Directed Planar Reachability Is in Unambiguous Log-Space
Improved Separations between Nondeterministic and Randomized Multiparty Communication
Hardness of Solving Sparse Overdetermined Linear Systems
Sound 3-Query PCPPs Are Long
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
Formula Caching in DPLL
Planarity, Determinants, Permanents, and (Unique) Matchings
Cell-Probe Proofs
Tradeoffs and Average-Case Equilibria in Selfish Routing
Lower Bounds for Coin-Weighing Problems
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
EUVIMED