Linear time algorithms for the basis of abelian groups

Authors:
Gregory Karagiorgos;Dimitrios Poulakis
Affiliations:
Department of Technology of Informatics and Telecommunications, T.E.I of Kalamata / Branch of Sparta, Sparta, Greece;Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki, Greece
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 11
Cited 0

Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix

SIAM Journal on Computing
A space efficient algorithm for group structure computation

Mathematics of Computation
Modern computer algebra

Modern computer algebra
The Pohlig-Hellman method generalized for group structure computation

Journal of Symbolic Computation
A Survey of Public-Key Cryptosystems

SIAM Review
Linear time algorithms for Abelian group isomorphism and related problems

Journal of Computer and System Sciences
Decodability of group homomorphisms beyond the johnson bound

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear and sublinear time algorithms for the basis of abelian groups

Theoretical Computer Science
Decomposing finite Abelian groups

Quantum Information & Computation
An algorithm for computing a basis of a finite abelian group

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
On the use of gröbner bases for computing the structure of finite abelian groups

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present two deterministic algorithms such that given an abelian group G with N elements and the prime factorization of N, it computes a basis of G in time O(N).