Computing a basis for a finite Abelian p-group

DOI10.1016/0020-0190(85)90086-9zbMath0591.20002OpenAlexW1977580131MaRDI QIDQ1074705

Costas S. Iliopoulos, W. M. Beynon

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90086-9

zbMATH Keywords

algorithmcomputational complexitybasisfinite presentationfinite abelian p-group

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Finite abelian groups (20K01) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS ⋮ An Algorithm for Computing a Basis of a Finite Abelian Group ⋮ Monte Carlo circuits for the abelian permutation group intersection problem ⋮ Analysis of algorithms on problems in general abelian groups

Cites Work

• Analysis of algorithms on problems in general abelian groups
• Computing in general Abelian groups is hard
• Fast computation of continued fraction expansions.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item