Computing the Fitting subgoup and solvable radical for small-basepermutation groups in nearly linear time - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Eugene M. Luks, Ákos Seress. Computing the Fitting subgoup and solvable radical for small-basepermutation groups in nearly linear time. In Larry Finkelstein, William M. Kantor, editors, Groups and Computation II, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, June 7-10, 1995. Volume 28 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 169-182, DIMACS/AMS, 1995.

The following publications are possibly variants of this publication:

Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear TimeMartin Schönert, Ákos Seress. issac 1994: 154-157 [doi]

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear TimeRobert Beals, Ákos Seress. stoc 1992: 116-125

Nearly Linear Time Algorithms for Permutation Groups with a Small BaseLászló Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress. issac 1991: 200-209 [doi]

runs on WebDSL