Determining cyclicity of finite modules (Q491255)

The paper presents a deterministic polynomial-time algorithm that determines whether a finite module \(M\) over a finite commutative ring \(R\) is cyclic, and if it is, outputs a generator, where the ring \(R\) is given as an abelian group by generators and relations, along with all the products of pairs of generators, the finite \(R\)-module \(M\) is given as an abelian group, and the module products in \(M\) are given for all generators of the abelian group \(R\) and all generators of the abelian group \(M\).