Advertisement

Complexity of the Schreier-Sims method

Permutation Groups
Part of the Lecture Notes in Computer Science book series (LNCS, volume 559)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Personalised recommendations