AbstractWe consider the quadratic complexity of certain sets of quadratic forms. We study classes of direct sums of quadratic forms. For these classes of problems we show that the complexity of one direct sum is the sum of the complexities of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm
AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear fo...
In this letter we propose a method to exactly certify the complexity of an active-set method which i...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
AbstractWe consider the quadratic complexity of certain sets of quadratic forms. We study classes of...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe prove the direct sum conjecture for various sets of systems of bilinear forms. Our result...
AbstractWe prove that if a quadratic system satisfies the direct sum conjecture strongly in the quad...
AbstractWe consider the problem of determining the fewest number of nonscalar multiplications needed...
AbstractLet the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-ga...
AbstractA straight-line additive computation which computes a set A of linear forms can be presented...
Abstract. A straight-line additive computation which computes a set SZ of linear forms can be presen...
Algebraic complexity theory, the study of the minimum number of operations suficient to perform alge...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
Submitted to the Department of Electronic and Computer Engineering in partial fulfilment of the requ...
One of the central problems of algebraic complexity theory is the complexity of multiplication in al...
AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear fo...
In this letter we propose a method to exactly certify the complexity of an active-set method which i...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
AbstractWe consider the quadratic complexity of certain sets of quadratic forms. We study classes of...
AbstractWe consider the bilinear complexity of certain sets of bilinear forms. We study a class of d...
AbstractWe prove the direct sum conjecture for various sets of systems of bilinear forms. Our result...
AbstractWe prove that if a quadratic system satisfies the direct sum conjecture strongly in the quad...
AbstractWe consider the problem of determining the fewest number of nonscalar multiplications needed...
AbstractLet the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-ga...
AbstractA straight-line additive computation which computes a set A of linear forms can be presented...
Abstract. A straight-line additive computation which computes a set SZ of linear forms can be presen...
Algebraic complexity theory, the study of the minimum number of operations suficient to perform alge...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
Submitted to the Department of Electronic and Computer Engineering in partial fulfilment of the requ...
One of the central problems of algebraic complexity theory is the complexity of multiplication in al...
AbstractThe number of nonscalar multiplications required to evaluate a general family of bilinear fo...
In this letter we propose a method to exactly certify the complexity of an active-set method which i...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
DOI
Add to ORKG