scientific article; zbMATH DE number 475356

zbMATH Open0830.20006MaRDI QIDQ4273602FDOQ4273602

Authors: Gene Cooperman, Larry Finkelstein 

Publication date: 21 January 1996

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

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

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)

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer proofs in group theory
• An algorithm for constructing representations of finite groups.
• Title not available (Why is that?)
• A practical model for computation with matrix groups.
• Title not available (Why is that?)
• The counting complexity of group-definable languages
• Computer algebra libraries for combinatorial structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)