On determining whether two polynomials are relatively prime

A comparison is made of the computational effort required for four different algorithms which establish whether two monic polynomials have a common zero. Two of the algorithms are based on the vanishing of the resultant and the other two on a recent theorem of Vogt and Bose.