A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
1987
SIAM Journal on Algebraic and Discrete Methods
Preserved Fulltext
B oolean circuits of polynomial size and poly-logarithmic depth are givenf or computing the Hermite and Smith normal forms of polynomial matrices overfinite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determine very efficient sequential algorithms. Furthermore, we give a polynomial-time deterministic sequential algorithm for the Smith normal form overthe rationals. The Smith normal form algorithms are applied to
doi:10.1137/0608057
fatcat:wi5nzwifljfifpxvshky2cd6pm