Linear time algorithms for the basis of Abelian groups.

DOI10.1007/978-3-642-22685-4_40MaRDI QIDQ3087971zbMATH OpenOpenAlexFDO

Authors Gregory Karagiorgos, Dimitros Poulakis

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_40

zbMATH Keywords

finite Abelian groupsgenerating systemsdeterministic linear algorithmsbases of Abelian groups

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Generators, relations, and presentations of groups (20F05) Number-theoretic algorithms; complexity (11Y16) Finite abelian groups (20K01)

Recommendations

• Linear and sublinear time algorithms for basis of abelian groups
• Linear and sublinear time algorithms for the basis of abelian groups
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups

Cited in

(7)

• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups
• Computing a basis for a finite Abelian p-group
• Linear and sublinear time algorithms for the basis of abelian groups
• Linear and sublinear time algorithms for basis of abelian groups
• Linear time algorithms for Abelian group isomorphism and related problems
• Efficient algorithms for the basis of finite abelian groups

This page was built for publication: Linear time algorithms for the basis of Abelian groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087971)