Schreier–Sims algorithm
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, test membership (is a given permutation contained in a group?), and many other tasks in polynomial time. It was introduced by Sims in 1970, based on 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.
- Comment
- enThe 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, test membership (is a given permutation contained in a group?), and many other tasks in polynomial time. It was introduced by Sims in 1970, based on 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.
- Has abstract
- enThe 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, test membership (is a given permutation contained in a group?), and many other tasks in polynomial time. It was introduced by Sims in 1970, based on 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.
- Hypernym
- Algorithm
- Is primary topic of
- Schreier–Sims algorithm
- Label
- enSchreier–Sims algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Base (group theory)
- Category:Computational group theory
- Category:Permutation groups
- Charles Sims (mathematician)
- Computational group theory
- Computer algebra system
- Deterministic
- Donald Knuth
- GAP computer algebra system
- Generating set of a group
- Knuth, Donald E.
- Magma computer algebra system
- Monte Carlo algorithm
- Orbit-stabilizer theorem
- Order (group theory)
- Otto Schreier
- Permutation group
- Randomized algorithm
- Schreier's subgroup lemma
- Schreier vector
- Strong generating set
- Transversal (combinatorics)
- SameAs
- 4uivx
- Algoritmo de Schreier–Sims
- m.03mgwr
- Q7432874
- Алгоритм Шрайера — Симса
- Subject
- Category:Computational group theory
- Category:Permutation groups
- WasDerivedFrom
- Schreier–Sims algorithm?oldid=990958507&ns=0
- WikiPageLength
- 6640
- Wikipage page ID
- 893640
- Wikipage revision ID
- 990958507