Normalisers of primitive permutation groups in quasipolynomial time

Bulletin of the London Mathematical Society, vol. 52, pp. 358–366

Abstract

We show that given generators for subgroups G and H of S n , if G is primitive then generators for N H ( G ) may be computed in quasipolynomial time, namely 2 O ( log 3 n ) . The previous best known bound was simply exponential.

Authors 0

1. Author list not loaded yet.