scientific article; zbMATH DE number 475356

MaRDI QIDQ4273602zbMATH OpenFDO

Authors Gene Cooperman, Larry Finkelstein

Publication date 21 January 1996

zbMATH Keywords

algorithmscomplexitydata structuresCayley graphscenterbase changepermutation groupsgroup membershipimplementationsnormal closure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• scientific article; zbMATH DE number 77937
• Fast Management of Permutation Groups I
• scientific article; zbMATH DE number 4057754
• scientific article; zbMATH DE number 3989617
• Permutation group algorithms based on partitions. I: Theory and algorithms

Cited in

(17)

• scientific article; zbMATH DE number 3869565 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Computer proofs in group theory
• How fast can we compute orbits of groups?
• An algorithm for constructing representations of finite groups.
• A practical model for computation with matrix groups.
• scientific article; zbMATH DE number 475361 (Why is no real title available?)
• scientific article; zbMATH DE number 1187227 (Why is no real title available?)
• The counting complexity of group-definable languages
• Computer algebra libraries for combinatorial structures
• scientific article; zbMATH DE number 4057754 (Why is no real title available?)
• scientific article; zbMATH DE number 77937 (Why is no real title available?)
• scientific article; zbMATH DE number 2149412 (Why is no real title available?)
• scientific article; zbMATH DE number 96388 (Why is no real title available?)
• Solvable black-box group problems are low for PP
• Baby-step giant-step algorithms for the symmetric group
• Certifying solutions to permutation group problems.

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