High speed computation of group characters

This paper describes a practical procedure for computing the ordinary irreducible characters of finite groups (of orders up to 1000 or so). The novelty of the method consists of transposing the problem from the field of complex numbers into the field of integers modulop for a suitable primep. It is much easier to compute the modular characters in the latter field, and from these characters we can calculate the ordinary irreducible characters in algebraic form.