 Schreier–Sims algorithm

The Schreier–Sims algorithm is a computational algorithm used for efficiently computing the action of a permutation group on a set, particularly when dealing with groups that are represented in terms of generators and relations. It is particularly useful in the context of coset enumeration and building up a group from its generators. The algorithm is named after two mathematicians, Otto Schreier and Charles Sims.