Analysis of algorithms on problems in general abelian groups (Q1062753)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of algorithms on problems in general abelian groups |
scientific article; zbMATH DE number 3915616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of algorithms on problems in general abelian groups |
scientific article; zbMATH DE number 3915616 |
Statements
Analysis of algorithms on problems in general abelian groups (English)
0 references
1985
0 references
Algorithms on abelian groups represented by an explicit set of generators are presented here. An algorithm for computing a set of defining relations and an algorithm for computing a complete basis of an abelian group are given. Also an algorithm for computing a basis for the (abelian) intersection of two abelian groups is given. All algorithms have worst-case time complexity polynomial in terms of the order of the group.
0 references
elementary operation
0 references
set of generators
0 references
defining relations
0 references
complete basis
0 references
intersection
0 references
time complexity
0 references
