@article{IMMERMAN1995103,
Abstract = {For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By refining 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 "first-order projections"-low-level reductions that do not obscure the algebraic nature of these problems.},
Author = {Immerman, N. and Landau, S.},
File = {The complexity of iterated multiplication - 1-s2.0-S0890540185710073-main.pdf},
ISSN = {0890-5401},
Journal = {Information and Computation},
Number = {1},
Pages = {103-116},
Title = {The Complexity of Iterated Multiplication},
URL = {https://www.sciencedirect.com/science/article/pii/S0890540185710073},
Volume = {116},
Year = {1995},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540185710073},
bdsk-url-2 = {https://doi.org/10.1006/inco.1995.1007},
date-added = {2023-10-03 14:54:52 +0200},
date-modified = {2023-10-03 14:54:52 +0200},
doi = {10.1006/inco.1995.1007}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A