For the problem of computing the greatest common divisor (GCD) of a set of polynomials, a subspace (SS) technique is introduced and compared with the matrix-pencil (MP) method proposed by Karcanias and Mitrouli. It is observed that the SS method is easier to implement and more robust to noise than the MP method.