Sciweavers

COCO
1989
Springer
110views Algorithms» more  COCO 1989»
13 years 8 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 ...
Neil Immerman, Susan Landau