AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear forms is investigated. An upper bound is obtained which is about half that obtained from naive arguments. In certain cases the best possible upper bound is obtained
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
One of the central problems of algebraic complexity theory is the complexity of multiplication in al...
Let U, V, W be finite dimensional vector spaces over a field k and let : U x V → W be a bilinear map...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractAn important class of problems in arithmetic complexity is that of computing a set of biline...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe define here the bilinear mincing rank of a bilinear form over a field of the characterist...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
AbstractThe classical structure theory of an (associative unitary) algebra A over a field F is invok...
We present a uniform description of sets of $m$ linear forms in $n$ variables over the field of rati...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractLet the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-ga...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
One of the central problems of algebraic complexity theory is the complexity of multiplication in al...
Let U, V, W be finite dimensional vector spaces over a field k and let : U x V → W be a bilinear map...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractAn important class of problems in arithmetic complexity is that of computing a set of biline...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe define here the bilinear mincing rank of a bilinear form over a field of the characterist...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
AbstractThe classical structure theory of an (associative unitary) algebra A over a field F is invok...
We present a uniform description of sets of $m$ linear forms in $n$ variables over the field of rati...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractLet the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-ga...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
One of the central problems of algebraic complexity theory is the complexity of multiplication in al...
Let U, V, W be finite dimensional vector spaces over a field k and let : U x V → W be a bilinear map...
DOI
Add to ORKG