e/Schreier-Sims algorithm

Information
has gloss	eng: The Schreier–Sims algorithm is an algorithm in computational group theory named after mathematicians Otto Schreier and Charles Sims. Once performed, it allows a linear time computation of the order of a finite group, group membership test (is a given permutation contained in a group?), and many other tasks. The algorithm was introduced by Sims in 1970 and is based on the Schreier's subgroup lemma. The timing was subsequently improved by Donald Knuth in 1991. Later, an even faster randomized version of the algorithm was developed.
lexicalization	eng: Schreier-Sims algorithm
lexicalization	eng: Schreier–Sims algorithm
instance of	e/Permutation group