scientific article; zbMATH DE number 77937

MaRDI QIDQ4016053zbMATH OpenFDO

Authors Jie Wang

Publication date 16 December 1992

zbMATH Keywords

algorithms for permutation groupscomputational complexitycoset enumerationstrong generating set

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Permutation group algorithms based on partitions. I: Theory and algorithms
• A strong generating test and short presentations for permutation groups
• scientific article; zbMATH DE number 3989617
• scientific article; zbMATH DE number 475356
• scientific article; zbMATH DE number 96388

Cited in

(15)

• A random base change algorithm for permutation groups
• Algorithmic search in group theory
• Algorithms for permutability in finite groups.
• Computation in permutation groups: Counting and randomly sampling orbits
• Estimation problems and randomised group algorithms.
• scientific article; zbMATH DE number 3869565 (Why is no real title available?)
• A New Base Change Algorithm for Permutation Groups
• scientific article; zbMATH DE number 66617 (Why is no real title available?)
• scientific article; zbMATH DE number 123361 (Why is no real title available?)
• scientific article; zbMATH DE number 1263311 (Why is no real title available?)
• scientific article; zbMATH DE number 1276819 (Why is no real title available?)
• scientific article; zbMATH DE number 475356 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• A unified approach to computations with permutation and matrix groups.
• Computing the order of a solvable permutation group

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