Lower bounds for polynomial evaluation and interpolation problems
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 378-383
- https://doi.org/10.1109/sfcs.1991.185394
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von InterpolationskoeffizientenNumerische Mathematik, 1973
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973