Content deleted Content added
Superninja (talk | contribs) No edit summary |
m wikify |
||
Line 1:
The '''Schreier-Sims algorithm''' is an efficient method of computing a [[strong generating set]] (SGS) of a [[permutation group]]. In particular, an SGS determines the order of a group and makes it easy to test membership in the group. Since the SGS is critical for many algorithms in [[computational group theory]],[[computer algebra system|computer algebra systems]] typically rely on the Schreier-Sims algorithm for efficient calculations in groups.
The running time of Schreier-Sims varies on the implementation. Let <math> G \leq S_n </math> be given by <math>t</math> [[generator|generators]]. For the [[deterministic]] version of the algorithm, possible running times are:
Line 6:
For [[Monte Carlo]] variations of the Schreier-Sims algorithm, we have the following estimated complexity:
*<math>O(n \log n \log^4 |G| + tn \log |G|)</math> requiring memory <math>O(n \log |G| + tn)</math>
In computer algebra systems, an optimized [[Monte-Carlo algorithm]] is typically used.
| |||