Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,356,366 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Algorithm
Black box group
Charles Sims (mathematician)
Computational group theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Habitação De Interesse Social: Uma Nova Proposta Para O Bairro Vila Nova, De Coronel Vivida – Paraná
João Rodolfo Petzhold Ferri
2018
Corpus ID: 165193660
Segundo a Agenda Habitat Declaracao de Istambul, (Apud BORGES, 2013, p. 31), a habitacao adequada e aquela na qual e perceptivel…
Expand
2018
2018
A Frobenius-Schreier-Sims Algorithm to tensor decompose algebras
I. Kessler
,
Henry Kvinge
,
James B. Wilson
2018
Corpus ID: 119324651
We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a…
Expand
2013
2013
Tight Bounds on the Synthesis of 3-Bit Reversible Circuits: Nffr Library
A. Younes
J. Circuits Syst. Comput.
2013
Corpus ID: 27935471
The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier–Sims algorithm for the strong…
Expand
2013
2013
Integration of Irreversible Gates in Reversible Circuits Using NCT Library
Mohamed Y. Osman
,
A. Younes
2013
Corpus ID: 124804107
The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm for the strong…
Expand
2012
2012
Consequence of Schreier-Sims Algorithm in Solving Rubik’s Cube
Sheik Ahmed Ullah
2012
Corpus ID: 126014667
Successful computation with a permutation group is largely depended on our ability to find an effective representative for the…
Expand
2007
2007
Symmetry Breaking in Subgraph Isomorphism
Stéphane Zampelli
,
Y. Deville
,
M. Saïdi
,
B. Benhamou
2007
Corpus ID: 14737241
The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern…
Expand
2004
2004
The Schreier-Sims algorithm for matrix groups
Henrik Baarnhielm
2004
Corpus ID: 16244127
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for…
Expand
2003
2003
The Schreier-Sims algorithm
Scott H. Murray
2003
Corpus ID: 16236195
A base and strong generating set provides an effective computer representation for a permutation group. This representation helps…
Expand
1999
1999
A Modification of the Schreier-Sims Algorithm Utilising the Transitivity of the Stabiliser Subgroups
W. Kocay
1999
Corpus ID: 122777682
A modification of the Schreier-Sims algorithm is described which builds a permutation group utilising the transitivity of the…
Expand
1995
1995
Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups
Scott H. Murray
,
Eamonn A. O'Brien
Journal of symbolic computation
1995
Corpus ID: 2932030
Abstract We consider the application of the Schreier-Sims algorithm and its variations to matrix groups defined over finite…
Expand
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)
ACCEPT & CONTINUE