scientific article; zbMATH DE number 1004937

zbMATH Open0878.20004MaRDI QIDQ4335300FDOQ4335300

Authors: Ákos Seress, Eugene M. Luks 

Publication date: 6 November 1997

Title of this publication is not available (Why is that?)

Recommendations

• Computing the soluble radical of a permutation group.
• scientific article; zbMATH DE number 1004940
• scientific article; zbMATH DE number 1273663
• scientific article; zbMATH DE number 1254261

zbMATH Keywords

Monte Carlo algorithms\(p\)-coresFitting subgroupssolvable radicalscentralizers of normal subgroupsnearly linear running timessmall-base permutation groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Finite nilpotent groups, (p)-groups (20D15) Subgroup theorems; subgroup growth (20E07)

Cited In (4)

• Computing conjugacy classes of elements in matrix groups.
• Automorphism group computation and isomorphism testing in finite groups
• Computing the soluble radical of a permutation group.
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335300)