Computing a basis for a finite Abelian p-group

DOI10.1016/0020-0190(85)90086-9zbMATH Open0591.20002OpenAlexW1977580131MaRDI QIDQ1074705FDOQ1074705

Authors: W. M. Beynon, Costas S. Iliopoulos 

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

Recommendations

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

zbMATH Keywords

computational complexityalgorithmbasisfinite 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast computation of continued fraction expansions.
• Computing in general Abelian groups is hard
• Title not available (Why is that?)
• Analysis of algorithms on problems in general abelian groups
• Title not available (Why is that?)

Cited In (6)

• Efficient algorithms for the basis of finite abelian groups
• Decomposability of finitely generated torsion-free nilpotent groups
• Monte Carlo circuits for the abelian permutation group intersection problem
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups
• Title not available (Why is that?)

This page was built for publication: Computing a basis for a finite Abelian p-group

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