Fast Parallel Matrix and GCD Computations
| dc.contributor.author | Borodin, Allan B. | en_US |
| dc.contributor.author | Von zur Gathen, Joachim | en_US |
| dc.contributor.author | Hopcroft, John E. | en_US |
| dc.date.accessioned | 2007-04-23T16:43:33Z | |
| dc.date.available | 2007-04-23T16:43:33Z | |
| dc.date.issued | 1982-04 | en_US |
| dc.description.abstract | We present parallel algorithms to compute the determinant and characteristic polynomial of n x n-matrices and the gcd of polynomials of degree $\leq$n. The algorithms use parallel time $O(\log^{2}n)$ and a polynomial number of processors. We also give a fast parallel Monte Carlo algorithm for the rank of matrices. All algorithms work over arbitrary fields. | en_US |
| dc.format.extent | 1730350 bytes | |
| dc.format.extent | 491094 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-487 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6327 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Fast Parallel Matrix and GCD Computations | en_US |
| dc.type | technical report | en_US |