Analysis of algorithms on problems in general abelian groups
Copyright policy )Analysis of algorithms on problems in general abelian groups
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.
- University of Warwick United Kingdom
- New Jersey Institute of Technology United States
intersection, time complexity, Analysis of algorithms and problem complexity, Symbolic computation and algebraic computation, defining relations, elementary operation, set of generators, Software, source code, etc. for problems pertaining to group theory, Abelian groups, complete basis
intersection, time complexity, Analysis of algorithms and problem complexity, Symbolic computation and algebraic computation, defining relations, elementary operation, set of generators, Software, source code, etc. for problems pertaining to group theory, Abelian groups, complete basis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!