scientific article; zbMATH DE number 434875

MaRDI QIDQ3139727zbMATH OpenFDO

Authors

Publication date 15 January 1996

zbMATH Keywords

algorithmsregularitygenerating setstime complexitypermutation groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Generators, relations, and presentations of groups (20F05)

Recommendations

• A strong generating test and short presentations for permutation groups
• scientific article; zbMATH DE number 475368
• scientific article; zbMATH DE number 1273663
• Nearly linear time algorithms for permutation groups: An interplay between theory and practice
• A random base change algorithm for permutation groups

Cited in

(2)

• An improvement to the centralizer algorithm for permutation groups
• Proportions of \(r\)-regular elements in finite classical groups.

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 Q3139727)