## Groups and Computation, Volume 11Consists of papers presented at the workshop on Groups and Computation held at DIMACS. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Permutation Groups and PolynomialTime Computation | 15 |

Computing Blocks of Imprimitivity for SmallBase Groups in Nearly | 17 |

Fast Fourier Transforms for Symmetric Groups | 27 |

Copyright | |

18 other sections not shown

### Other editions - View all

Groups and Computation II: Workshop on Groups and Computation, June 7-10, 1995 Larry Finkelstein,William M. Kantor No preview available - 1997 |

### Common terms and phrases

algebra apply Babai base change block of imprimitivity bound calculate Cayley graph computational group theory conjugate construction Corollary coset representatives defined denote deterministic efficient example finite group finite simple groups Finkelstein Fourier transform function given group elements group G group of degree implementation input integers isomorphic isotypic Kantor Lemma Let G linear log G log2 Luks Math Mathematics Subject Classification matrix maximal minimal Monte Carlo algorithm multiplications node normal closure normal subgroup number field output parallel permutation groups permutation representation point stabilizer polynomial polynomial-time primitive groups probability at least problem Proc procedure processor proof Proposition quotient quotpic Radon transform random elements random subproduct reliability result Schreier trees Schreier vector Schreier vector data sequence Seress small base groups solvable groups strong generating set subgroup of Sn subgroups G subset subspaces Sylow p-subgroup Sym(fi symmetric group Theorem transitive vector data structure