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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Reversible logic has been considered as an important solution to the power dissipation problem in the existing electronic devices…

2018

We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a…

2013

The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm for the strong…

2012

Successful computation with a permutation group is largely depended on our ability to find an effective representative for the…

2007

The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern…

2004

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

A base and strong generating set provides an effective computer representation for a permutation group. This representation helps…

1999

A modification of the Schreier-Sims algorithm is described which builds a permutation group utilising the transitivity of the…