Abstract
The base change algorithm is an efficient means of determining a strong generating set relative to a base, provided that some base and strong generating set for the group is known.
This is a preview of subscription content, log in via an institution to check access.
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). Base change. 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_31
Download citation
DOI: https://doi.org/10.1007/3-540-54955-2_31
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