Author :
Borodin, Allan ; Borodin, Allan ; Borodin, Allan ; Borodin, Allan ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; Hopcroft, John ; Hopcroft, John ; Hopcroft, John ; Hopcroft, John
Abstract :
We present parallel algorithms to compute the determinant and characteristic polynomial of n×n-matrices and the gcd of polynomials of degree ≤n. The algorithms use parallel time O(log2n) and a polynomial number of processors. We also give a fast parallel Las Vegas algorithm for the rank of matrices. All algorithms work over arbitrary fields.
