S

Schreier–Sims algorithm

Polynomial algorithm for order of permutation group computation

The Schreier–Sims algorithm is an algorithm in computational group theory, named after the mathematicians Otto Schreier and Charles Sims. This algorithm can find the order of a finite permutation group, determine whether a given permutation is a member of the group, and other tasks in polynomial time.

Nº Q7432874 ★

Commune · Savoirs

Schreier–Sims algorithm

Polynomial algorithm for order of permutation group computation

Texte en anglais

The Schreier–Sims algorithm is an algorithm in computational group theory, named after the mathematicians Otto Schreier and Charles Sims. This algorithm can find the order of a finite permutation group, determine whether a given permutation is a member of the group, and other tasks in polynomial time.

Sur Wikipédia

Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

The Schreier–Sims algorithm is an algorithm in computational group theory, named after the mathematicians Otto Schreier and Charles Sims. This algorithm can find the order of a finite permutation group, determine whether a given permutation is a member of the group, and other tasks in polynomial time. It was introduced by Sims in 1970, based on Schreier's subgroup lemma. The running time was subsequently improved by Donald Knuth in 1991. Later, an even faster randomized version of the algorithm was developed.

Texte : Wikipédia en anglais, CC BY-SA 4.0. ·

Cartes voisines

Ouvrir

…

Confirmation