Now showing items 1-2 of 2

• Fast Parallel Matrix and GCD Computations ﻿

(Cornell University, 1982-04)
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 ...
• Functional Decomposition of Polynomials ﻿

(Cornell University, 1987-07)
ABSTRACT NOT AVAILABLE