We describe in some detail an algorithm which is an important ingredie
nt in the performance of programs for working with descriptions of gro
ups of prime-power order. It is an algorithm for computing a useful po
wer-commutator presentation for the p-covering group of a group given
by a power-commutator presentation. We prove that the algorithm is cor
rect and give some examples. (C) 1998 Academic Press Limited.