Skip to search formSkip to main contentSkip to account menu

Schreier–Sims algorithm

Known as: Schreier-Sims algorithm 
The Schreier–Sims algorithm is an algorithm in computational group theory named after mathematicians Otto Schreier and Charles Sims. Once performed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
AlgorithmBlack box groupCharles Sims (mathematician)Computational group theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Frobenius-Schreier-Sims Algorithm to tensor decompose algebras
We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a… 
2012
2012
Consequence of Schreier-Sims Algorithm in Solving Rubik’s Cube
Successful computation with a permutation group is largely depended on our ability to find an effective representative for the… 
2007
2007
Symmetry Breaking in Subgraph Isomorphism
The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern… 
2004
2004
The Schreier-Sims algorithm for matrix groups
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for… 
2003
2003
The Schreier-Sims algorithm
A base and strong generating set provides an effective computer representation for a permutation group. This representation helps… 
1999
1999
A Modification of the Schreier-Sims Algorithm Utilising the Transitivity of the Stabiliser Subgroups
A modification of the Schreier-Sims algorithm is described which builds a permutation group utilising the transitivity of the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)