Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

10 relations
AlgorithmBlack box groupCharles 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á
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
We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a… Expand
2014
2014
Tight Bounds on the Synthesis of 3-Bit Reversible Circuits: Nffr Library
  • A. Younes
  • J. Circuits Syst. Comput.
  • 2014
    • Corpus ID: 27935471
The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier–Sims algorithm for the strong… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • table 1
  • table 3
  • table 4
  • table 5
  • table 8
2003
2003
The Schreier-Sims algorithm
A base and strong generating set provides an effective computer representation for a permutation group. This representation helps… Expand
  • figure 2.1
  • figure 2.2
  • table 2.1
  • table 4.1
  • table 4.2
Highly Cited
2003
Highly Cited
2003
Exploiting orbits in symmetric ILP
  • F. Margot
  • Math. Program.
  • 2003
    • Corpus ID: 5856454
Abstract.This paper describes components of a branch-and-cut algorithm for solving integer linear programs having a large… Expand
  • table 1
  • table 2
  • table 3
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… Expand
1995
1995
Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups
Abstract We consider the application of the Schreier-Sims algorithm and its variations to matrix groups defined over finite… Expand
  • table 1
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE