An exponential lower bound for the sum of powers of bounded degree polynomials

  title={An exponential lower bound for the sum of powers of bounded degree polynomials},
  author={Neeraj Kayal},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  • Neeraj Kayal
  • Published 2012 in Electronic Colloquium on Computational Complexity
In this work we consider representations of multivariate polynomials in F[x] of the form f(x) = Q1(x)1 +Q2(x)2 + . . .+Qs(x) , where the ei’s are positive integers and the Qi’s are arbitary multivariate polynomials of degree at most d. We give an explicit n-variate polynomial f of degree n such that any representation of the above form for f requires the number of summands s to be 2Ω( n d ). We also give a asymptotically matching upper bound of 2O( n d ). 
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
48 Citations
7 References
Similar Papers


Publications citing this paper.

69 Citations

Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-7 of 7 references

Partial derivatives in arithmetic complexity

  • Xi Chen, Neeraj Kayal, Avi Wigderson
  • Foundations and Trends in Theoretical Computer…
  • 2011

Sums of like powers of multivariate linear forms

  • I. Fischer
  • Mathematics Magazine,
  • 1994

A waring’s problem’ for homogeneous forms

  • W. J. Ellison
  • Proceedings of the Cambridge Philosophical…
  • 1969

Similar Papers

Loading similar papers…