Thumbnail
Access Restriction
Subscribed

Author Larson, Richard G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Two algorithms for computing the multiplication table of a 2-group are described and discussed. One of the algorithms works in an element-by-element fashion; the other works in terms of subgroups generated by initial subsequences of the given sequence of generators. Estimates of computation times are given which show that the second algorithm is much more efficient than the first. It is also shown how the second algorithm can be modified to make it more useful, without using significantly more time.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1976-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 2
Page Count 7
Starting Page 235
Ending Page 241


Open content in new tab

   Open content in new tab
Source: ACM Digital Library