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 ★
Common · Knowledge
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.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Needleman–Wunsch algorithm
Algorithm
Nº Q583546 ★
Not listed
-
G
Gale–Shapley algorithm
Algorithm for solving the stable matching problem
Nº Q65123731 ★★
Not listed
-
S
Shor's algorithm
Quantum algorithm for integer factorization
Nº Q940334 ★★★
Not listed
-
H
Herbert Sturges
American statistician
Nº Q12259042 ★
Not listed
-
Smith–Waterman algorithm
Algorithm performs local sequence alignment
Nº Q1683352 ★
Not listed
-
E
Entscheidungsproblem
In computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Nº Q11030584 ★★
Not listed