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.

• Type: Conference
• Year: 1989
• Where: COCO
• Authors: Neil Immerman, Susan Landau
• Keywords: Algorithms, COCO 1989, Completeness Arguments, Iterated Multiplication Problems, Low-level Complexity Classes