Title :
The complexity of iterated multiplication
Author :
Immerman, Neil ; Landau, Susan
Author_Institution :
Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
Abstract :
The complexity of multiplying together n elements of a group G is studied. It is observed that as G ranges over a sequence of well-studied groups, the iterated multiplication problem is complete for corresponding well-studied complexity classes. Furthermore, the notion of completeness in question is extremely low-level and algebraic. The issue of uniformity is investigated
Keywords :
computational complexity; digital arithmetic; completeness; complexity; complexity classes; iterated multiplication; iterated multiplication problem; uniformity; Circuits; Computer science; Mathematics; Polynomials; Symmetric matrices;
Conference_Titel :
Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
Conference_Location :
Eugene, OR
Print_ISBN :
0-8186-1958-9
DOI :
10.1109/SCT.1989.41816
