Computing polynomials with few multiplications

  • Shachar Lovett
  • Published 2011 in Electronic Colloquium on Computational Complexity

Abstract

It is a folklore result in arithmetic complexity that the number of multiplication gates required to compute a worst-case n-variate polynomial of degree d is at least 
DOI: 10.4086/toc.2011.v007a013

Topics

Cite this paper

@article{Lovett2011ComputingPW, title={Computing polynomials with few multiplications}, author={Shachar Lovett}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2011}, volume={18}, pages={94} }