International audienceIn this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor. Previous lower bounds for this problem were only of order Ω(√ d), and were obtained from arguments based on Wronskian determinants and "shifted derivatives." We obtain this improvement thanks to a new lower bound method based on Birkhoff interpolation (also known as "lacunary polynomial interpolation")
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
The general framework of this thesis is the study of polynomials as objects of models of computation...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
AbstractWe prove new lower bounds for the complexity of polynomials, e.g., for polynomials with 0–1-...
14 pagesA polynomial identity testing algorithm must determine whether a given input polynomial is i...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
International audienceWe call shifted power a polynomial of the form $(x-a)^e$. The main goal of thi...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
What is the smallest formula computing a given multivariate polynomial f(x)= In this talk I will pr...
According to the real $\tau$-conjecture, the number of real roots of a sum of products of sparse uni...
We study the complexity of representing polynomials as a sum of products of polynomials in few varia...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
The general framework of this thesis is the study of polynomials as objects of models of computation...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
The general framework of this thesis is the study of polynomials as objects of models of computation...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
International audienceIn this paper we give lower bounds for the representation of real univariate p...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
AbstractWe prove new lower bounds for the complexity of polynomials, e.g., for polynomials with 0–1-...
14 pagesA polynomial identity testing algorithm must determine whether a given input polynomial is i...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
International audienceWe call shifted power a polynomial of the form $(x-a)^e$. The main goal of thi...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
What is the smallest formula computing a given multivariate polynomial f(x)= In this talk I will pr...
According to the real $\tau$-conjecture, the number of real roots of a sum of products of sparse uni...
We study the complexity of representing polynomials as a sum of products of polynomials in few varia...
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for c...
The general framework of this thesis is the study of polynomials as objects of models of computation...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
The general framework of this thesis is the study of polynomials as objects of models of computation...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...