Efficient algorithms for computing the characteristic polynomial in a domain

Two new sequential methods are given for computing the characteristic polynomial of an endomorphism of a free finite rank-n module over a domain, that require O(n3) ring operations with exact divisions.