Publication date
December 1985
DOI Publisher
Published by Elsevier B.V. ISSN
0304-3975 Citation count (estimate)
79Abstract
AbstractComputing the coefficients of the characteristic polynomial is about as hard as matrix multiplication
AbstractComputing the coefficients of the characteristic polynomial is about as hard as matrix multiplication
We review the complexity of polynomial and matrix computations, as well as their various correlation...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
Parallel algorithms to compute the determinant and characteristic polynomial of matrices and the gcd...
AbstractComputing the coefficients of the characteristic polynomial is about as hard as matrix multi...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
Various algorithms connected with the computation of the minimal polynomial of a square n x n matrix...
We study the link between the complexity of polynomial matrix multiplication and the complexity of s...
This article deals with the computation of the characteristic polynomial of dense matrices over smal...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
AbstractFirst we study asymptotically fast algorithms for rectangular matrix multiplication. We begi...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
Parallel algorithms to compute the determinant and characteristic polynomial of matrices and the gcd...
AbstractComputing the coefficients of the characteristic polynomial is about as hard as matrix multi...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
Various algorithms connected with the computation of the minimal polynomial of a square n x n matrix...
We study the link between the complexity of polynomial matrix multiplication and the complexity of s...
This article deals with the computation of the characteristic polynomial of dense matrices over smal...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
AbstractFirst we study asymptotically fast algorithms for rectangular matrix multiplication. We begi...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
Parallel algorithms to compute the determinant and characteristic polynomial of matrices and the gcd...
Add to ORKG