Cover Page The handle http://hdl.handle.net/1887/40676

The handle http://hdl.handle.net/1887/40676 holds various files of this Leiden University

(Coprime Base Algorithm) There exists a deterministic polynomial-time algorithm that takes as input a finite set of positive integers S and outputs a coprime base B for S, and

There exists a deterministic polynomial-time algorithm such that, given a finite abelian group G, computes the exponent of G and produces an element g ∈ G of order equal to

There exists a deterministic polynomial-time algorithm that, given a finite ring R, computes its centre, prime subring and

Their algorithm is based on finding nilpotent endomorphisms of one of the modules and in fact does more than test for module isomorphism – it produces the largest isomorphic

There exists a deterministic polynomial-time reduction from the decision (resp. constructive) version of nonsingular matrix completion to the problem of deciding existence of

If j A is an approximation of the Jacobson radical of A, then the ring A/j A has many of the good properties that semisimple rings have: it has “many” projective and injective

Polynomial time algorithms for mod- ules over finite dimensional algebras.. Chou