The Complexity of Group Algebra Computations

Abstract In this paper we study the computation of a set of bilinear forms associated with a finite group. In the case of a cyclic group these bilinear forms represent the well-known circular convolution of two sequences and can be evaluated efficiently using the fast finite Fourier transform. We shall use a similar technique in the case of a general finite group and will apply it to calculate group algebra products.