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.
No takes yet. Share an insight, caveat, or question.
Borodin et al. (1982) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: