Analysis of algorithms on problems in general abelian groups

DOI10.1016/0020-0190(85)90052-3zbMath0573.68009OpenAlexW2075056391MaRDI QIDQ1062753

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)90052-3

zbMATH Keywords

time complexitydefining relationsintersectionset of generatorscomplete basiselementary operation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) Abelian groups (20K99)

Related Items (5)

EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS ⋮ On the computational complexity of the Abelian permutation group structure, membership and intersection problems ⋮ An Algorithm for Computing a Basis of a Finite Abelian Group ⋮ Computing in general Abelian groups is hard ⋮ Computing a basis for a finite Abelian p-group

Cites Work

• Computing in general Abelian groups is hard
• Computing a basis for a finite Abelian p-group
• Fast multiplication of large numbers
• Fast computation of continued fraction expansions.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of algorithms on problems in general abelian groups