Showing papers by "Costas S. Iliopoulos published in 1985"

TL;DR: The group-theoretic problems above are computationally harder than factorization and primality testing, and the problem of ‘prime factorization’ is shown to be polynomial time reducible to the problems.

TL;DR: All algorithms on abelian groups represented by an explicit set of generators have worst-case time complexity polynomial in terms of the order of the group.

TL;DR: An algorithm for computing a basis for a finite abelian p-group, given a set of generators, is described, particularly suited for use when the elements of the generating set are produced sequentially.