Learn More
In this paper, we study some algorithms for computing an Hermite reduction of a matrix with polynomial entries which avoid the swell-up of the size of intermediary objects and have a good sequential complexity. The second and the third algorithms generalize the sub-resultant method for computing the gcd of two polynomials. The last one is optimal in the(More)
  • 1