[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 378-383

V. Shoup , Dept. of Comput. Sci., Toronto Univ., Ont., Canada

R. Smolensky , Dept. of Comput. Sci., Toronto Univ., Ont., Canada

ABSTRACT

It is shown that there is a set of points p/sub 1/, p/sub 2/,. . .,p/sub n/ such that any algebraic program of depth d for polynomial evaluation (or interpolation) at these points has size Omega (n log n/log d). Moreover, if d is a constant, then a lower bound of Omega (n/sup 1+1/d/) is obtained.

INDEX TERMS

lower bound, polynomial evaluation, interpolation problems, algebraic program

CITATION

V. Shoup and R. Smolensky, "Lower bounds for polynomial evaluation and interpolation problems,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 378-383.

doi:10.1109/SFCS.1991.185394

CITATIONS