A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
1997
Proceedings of the second international symposium on Parallel symbolic computation - PASCO '97
We establish that the problem of computing a gcd-free basis for a set of polynomials is in AfC~for any arbitrary field F. This leads to a proof that arithmetic for a simple algebraic extension is in N@. This result is applied to improve the complexity of the parallel deterministic algorithm to compute the Jordan normal form of a n dimensional matrix in time 0(log2 n). Fast Gcd-l%e Basis Computations Let F be an arbitrary commutative field. The computational model used in this section is the
doi:10.1145/266670.266682
dblp:conf/cap/GautierR97
fatcat:7v6fdjfwafcfzbu7hr56v773ci