The complexity of iterated multiplication
From MaRDI portal
Publication:1346717
DOI10.1006/inco.1995.1007zbMath0818.68076OpenAlexW2093623799MaRDI QIDQ1346717
Publication date: 10 April 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1f7601d7b6d2c944341aed511de39ed781bba158
Related Items
Uniform constant-depth threshold circuits for division and iterated multiplication., Dichotomies for classes of homomorphism problems involving unary functions, A note on logspace optimization, Counting quantifiers, successor relations, and logarithmic space, Dyn-FO: A parallel, dynamic complexity class, Dual VP classes, The isomorphism conjecture for constant depth reductions, Interleaved Group Products, The expressiveness of a family of finite set languages, The invariant problem for binary string structures and the parallel complexity theory of queries, A constant-space sequential model of computation for first-order logic, Characterizing Valiant's algebraic complexity classes, A constant-space sequential model of computation for first-order logic, Succinct representation, leaf languages, and projection reductions, Threshold circuits of small majority-depth, Non-commutative arithmetic circuits: depth reduction and size lower bounds, On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
