Add to ORKGAbstract. The rank of the matrix multiplication operator for n×n matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least 3n2−o(n2). More precisely, for any integer p ≤ n − 1 the rank is at least (3 − 1 p+
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
We investigate the complexity of enumerative approximation of two elementary problems in linear alge...
We prove that the rank of the n×n matrix multiplication is at least 3n2 - 2√2n3/2 - 3n. The previous...
AbstractThe following results are proved: Let A = (aij) be an n × n complex matrix, n ⩾ 2, and let k...
AbstractWe consider maintaining information about the rank of a matrix under changes of the entries....
AbstractWe consider the computational complexity of some problems dealing with matrix rank. Let E, S...
Abstract The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditi...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
We show that the border support rank of the tensor corresponding to two-by-two matrix multiplicatio...
For two matrix operations, called quasi--direct sum and quasi--outer product, we determine their dev...
Ahlswede R, Cai N. Rank formulas for certain products of matrices. Applicable Algebra in Engineering...
The rank of a matrix seems to play a role in the context of communication complexity, a framework de...
AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...
We investigate the complexity of enumerative approximation of two elementary problems in linear alg...
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
We investigate the complexity of enumerative approximation of two elementary problems in linear alge...
We prove that the rank of the n×n matrix multiplication is at least 3n2 - 2√2n3/2 - 3n. The previous...
AbstractThe following results are proved: Let A = (aij) be an n × n complex matrix, n ⩾ 2, and let k...
AbstractWe consider maintaining information about the rank of a matrix under changes of the entries....
AbstractWe consider the computational complexity of some problems dealing with matrix rank. Let E, S...
Abstract The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditi...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
We show that the border support rank of the tensor corresponding to two-by-two matrix multiplicatio...
For two matrix operations, called quasi--direct sum and quasi--outer product, we determine their dev...
Ahlswede R, Cai N. Rank formulas for certain products of matrices. Applicable Algebra in Engineering...
The rank of a matrix seems to play a role in the context of communication complexity, a framework de...
AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...
We investigate the complexity of enumerative approximation of two elementary problems in linear alg...
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
n this paper, we characterize the rank of a matrix over the symmetrized max-plus algebra. This chara...
We investigate the complexity of enumerative approximation of two elementary problems in linear alge...