High Quality Content by WIKIPEDIA articles! 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, 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.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.