Abstract
Obtaining a list of elements is the first step in studying a small group, and Dimino's algorithm is the best known algorithm for obtaining the list. The summation terms in the analysis of Dimino's algorithm can be crudely bounded by the order of the group. Therefore, the total cost is never more than 2צG¦ multiplications and ¦G¦ searches.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1991). List of elements. In: Butler, G. (eds) Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science, vol 559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54955-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-54955-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54955-0
Online ISBN: 978-3-540-46607-9
eBook Packages: Springer Book Archive