Analysis of algorithms on problems in general abelian groups

Document Type

Article

Publication Date

5-10-1985

Abstract

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. © 1985.

Identifier

0022060762 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/0020-0190(85)90052-3

ISSN

00200190

First Page

215

Last Page

220

Issue

4

Volume

20

This document is currently not available here.

Share

COinS