Sciweavers

COCO
1989
Springer

The Complexity of Iterated Multiplication

14 years 3 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over a natural series of important groups and monoids, the iterated multiplication problems are complete for most natural, low-level complexity classes. The completeness is with respect to \ rst-order projections" { low-level reductions that do not obscure the algebraic nature of these problems.
Neil Immerman, Susan Landau
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1989
Where COCO
Authors Neil Immerman, Susan Landau
Comments (0)