scientific article; zbMATH DE number 96387

MaRDI QIDQ4020768zbMATH OpenFDO

Authors Gene Cooperman, Larry Finkelstein

Publication date 17 January 1993

zbMATH Keywords

base changescube Schreier treesfast group membership testingfinite groupgroup generatorsMonte Carlo algorithmspermutation groupsrandom prefixesrandom subproductsstrong generating set

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)

Recommendations

• Fast Monte Carlo algorithms for permutation groups
• A strong generating test and short presentations for permutation groups
• A random base change algorithm for permutation groups
• scientific article; zbMATH DE number 475368
• scientific article; zbMATH DE number 3968860

Cited in

(19)

• Generating random elements in finite groups.
• A random base change algorithm for permutation groups
• Monte Carlo circuits for the abelian permutation group intersection problem
• Fast Monte Carlo algorithms for permutation groups
• Efficient algorithmic learning of the structure of permutation groups by examples
• Algorithms for permutability in finite groups.
• Linear time algorithms for Abelian group isomorphism and related problems
• Estimation problems and randomised group algorithms.
• The Subgroup Algorithm for Generating Uniform Random Variables
• A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
• scientific article; zbMATH DE number 3968860 (Why is no real title available?)
• scientific article; zbMATH DE number 4108985 (Why is no real title available?)
• scientific article; zbMATH DE number 38085 (Why is no real title available?)
• scientific article; zbMATH DE number 475368 (Why is no real title available?)
• scientific article; zbMATH DE number 475369 (Why is no real title available?)
• scientific article; zbMATH DE number 1004926 (Why is no real title available?)
• scientific article; zbMATH DE number 1047717 (Why is no real title available?)
• An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
• Quotient tests and random walks in computational group theory.

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