Abstract
In the first [*, High Perf. Comp. in Science and Engin. ‘98, HLRS Stuttgart, Springer-Verlag Berlin, 1998, pp. 430–452] article on this topic the author described an implementation and the construction of the corresponding hash table of the modified Cooperman-Finkelstein-Tselman-York algorithm [Cooperman, Finkelstein, Tselman, and York, Constructing permutation representations for large matrix groups, Proc. of Int. Symp. on Symb. and Algeb. Comp. ISSAC ‘94 (New York), (Oxford), ACM Press, 1994, pp. 134–138] constructing a transitive permutation representation from a given matrix representation of a finite group G over a finite field F and its non-trivial restriction to a given subgroup.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
