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 ★
Comum · Saberes
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Algoritmo Needleman-Wunsch
Nº Q583546 ★
Sem ofertas
-
G
Gale–Shapley algorithm
Algorithm for solving the stable matching problem
Nº Q65123731 ★★
Sem ofertas
-
A
Algoritmo de Shor
É um algoritmo quântico para fatorar um número N não primo de L bits
Nº Q940334 ★★★
Sem ofertas
-
H
Herbert Sturges
Matemático e estatístico alemão
Nº Q12259042 ★
Sem ofertas
-
Algoritmo de Smith-Waterman
Nº Q1683352 ★
Sem ofertas
-
E
Entscheidungsproblem
Nº Q11030584 ★★
Sem ofertas