Minimal sized generating sets of permutation groups

Abstract

We present a randomised variant of an algorithm of Lucchini and Thakkar for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.