# Schreier-Sims algorithm

How do we test for membership in a permutation group? Membership testing can be achieved using bases and strong generating sets to describe permutation groups. Given a set of generators for a permutation group, the Schreier-Sims algorithm is used to find a base and strong generating set for that group. This talk introduces Schreier's observation about generating subgroups and Sim's work on representing permutation groups.