AbstractWe prove a lower bound of 2mn+2n−m−2 for the bilinear complexity of the multiplication of n×m-matrices with m×n-matrices using the substitution method (m⩾n⩾3). In particular, we obtain the improved lower bound of 19 for the bilinear complexity of 3×3-matrix multiplication
AbstractIn this paper the problem of complexity of multiplication of a matrix with a vector is studi...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractWe prove a lower bound of 2mn+2n−m−2 for the bilinear complexity of the multiplication of n×...
AbstractWe present several bilinear algorithms for the acceleration of multiplication of n X n matri...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplicati...
AbstractThe number of essential multiplications required to multiply matrices of size N×N and N×Nx i...
Let M(n) denote the bit complexity of multiplying n-bit integers, let ω ∈ (2, 3] be an exponent for ...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
These notes are based on a lecture given at the Toronto Student Seminar on February 2, 2012. The mat...
This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/...
AbstractWe consider the problem of finding a basic solution to a system of linear constraints (in st...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
AbstractIn this paper the problem of complexity of multiplication of a matrix with a vector is studi...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractWe prove a lower bound of 2mn+2n−m−2 for the bilinear complexity of the multiplication of n×...
AbstractWe present several bilinear algorithms for the acceleration of multiplication of n X n matri...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplicati...
AbstractThe number of essential multiplications required to multiply matrices of size N×N and N×Nx i...
Let M(n) denote the bit complexity of multiplying n-bit integers, let ω ∈ (2, 3] be an exponent for ...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
These notes are based on a lecture given at the Toronto Student Seminar on February 2, 2012. The mat...
This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/...
AbstractWe consider the problem of finding a basic solution to a system of linear constraints (in st...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
AbstractIn this paper the problem of complexity of multiplication of a matrix with a vector is studi...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
DOI
Add to ORKG