Recommendations
Cites work
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1284153 (Why is no real title available?)
- scientific article; zbMATH DE number 1836318 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Comparison techniques for random walk on finite groups
- Constructive recognition of classical groups in odd characteristic.
- Generating random elements in finite groups.
- Generating random elements of a finite group
- Karl Pearson and the Chi-Squared Test
- Moderate growth and random walk on finite groups
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- The Distribution of Chi-Square
- The Magma algebra system. I: The user language
- The computational matrix group project.
- What do we know about the product replacement algorithm?
Cited in
(10)- An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
- Showcasing straight-line programs with memory via matrix Bruhat decomposition
- Product Replacement in the Monster
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- Interactions of computational complexity theory and mathematics
- scientific article; zbMATH DE number 1445359 (Why is no real title available?)
- What do we know about the product replacement algorithm?
- On a variant of the product replacement algorithm
- Nielsen equivalence in Fuchsian groups
- Generating random elements of a finite group
This page was built for publication: The product replacement prospector.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654033)