We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Omega(root d/t) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials
We show here a 2(Omega(root d center dot logN)) size lower bound for homogeneous depth four arithmet...
The representations, including polynomial, of functions over final fields have been actively investi...
AbstractWe improve some lower bounds which have been obtained by Strassen and Lipton. In particular ...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
What is the smallest formula computing a given multivariate polynomial f(x)= In this talk I will pr...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
We show here a 2(Omega(root d center dot logN)) size lower bound for homogeneous depth four arithmet...
The representations, including polynomial, of functions over final fields have been actively investi...
AbstractWe improve some lower bounds which have been obtained by Strassen and Lipton. In particular ...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
What is the smallest formula computing a given multivariate polynomial f(x)= In this talk I will pr...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
We show here a 2(Omega(root d center dot logN)) size lower bound for homogeneous depth four arithmet...
The representations, including polynomial, of functions over final fields have been actively investi...
AbstractWe improve some lower bounds which have been obtained by Strassen and Lipton. In particular ...
DOI
Add to ORKG