Complexity of the Schreier-Sims method
We have presented some variations of the Schreier-Sims method which are simple enough to analyse. They all store actual permutations for the coset representatives. Jerrum's algorithm gives an O (¦Ω¦5) time complexity and an O (¦Ω¦2) space requirement.
Unable to display preview. Download preview PDF.