AbstractWe prove the direct sum conjecture for various sets of systems of bilinear forms. Our results depend on a priori knowledge of the complexity of at least one of the direct summands and its underlying algebraic structure. We also briefly survey some previous results concerning the complexity and structure of minimal algorithms for various direct sum systems
Abstract. A straight-line additive computation which computes a set SZ of linear forms can be presen...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
AbstractWe prove the direct sum conjecture for various sets of systems of bilinear forms. Our result...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe consider the quadratic complexity of certain sets of quadratic forms. We study classes of...
AbstractWe prove that if a quadratic system satisfies the direct sum conjecture strongly in the quad...
AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear fo...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractIn this paper we classify all the minimal bilinear algorithms for computing the coefficients...
AbstractA straight-line additive computation which computes a set A of linear forms can be presented...
In the paper we formulate a criterion for the nonsingularity of a bilinear form on a direct sum of ...
International audienceWe bound the Boolean complexity of computing isolating hyperboxes for all comp...
Direct-sum questions in (two-party) communication complexity ask whether two parties, Alice and Bob,...
Abstract. A straight-line additive computation which computes a set SZ of linear forms can be presen...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
AbstractWe prove the direct sum conjecture for various sets of systems of bilinear forms. Our result...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe consider the quadratic complexity of certain sets of quadratic forms. We study classes of...
AbstractWe prove that if a quadratic system satisfies the direct sum conjecture strongly in the quad...
AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear fo...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractIn this paper we classify all the minimal bilinear algorithms for computing the coefficients...
AbstractA straight-line additive computation which computes a set A of linear forms can be presented...
In the paper we formulate a criterion for the nonsingularity of a bilinear form on a direct sum of ...
International audienceWe bound the Boolean complexity of computing isolating hyperboxes for all comp...
Direct-sum questions in (two-party) communication complexity ask whether two parties, Alice and Bob,...
Abstract. A straight-line additive computation which computes a set SZ of linear forms can be presen...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
DOI
Add to ORKG