Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Schreier–Sims_algorithm> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Schreier–Sims_algorithm abstract "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 (is a given permutation contained in a group?), and many other tasks. The algorithm 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.".
- Schreier–Sims_algorithm wikiPageID "893640".
- Schreier–Sims_algorithm wikiPageRevisionID "551251342".
- Schreier–Sims_algorithm subject Category:Computational_group_theory.
- Schreier–Sims_algorithm subject Category:Permutation_groups.
- Schreier–Sims_algorithm comment "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 (is a given permutation contained in a group?), and many other tasks. The algorithm was introduced by Sims in 1970, based on Schreier's subgroup lemma. The timing was subsequently improved by Donald Knuth in 1991.".
- Schreier–Sims_algorithm label "Schreier–Sims algorithm".
- Schreier–Sims_algorithm sameAs Schreier%E2%80%93Sims_algorithm.
- Schreier–Sims_algorithm sameAs Q7432874.
- Schreier–Sims_algorithm sameAs Q7432874.
- Schreier–Sims_algorithm wasDerivedFrom Schreier–Sims_algorithm?oldid=551251342.