The area-time complexity of polynomial interpolation, and of the evaluation of a polynomial at given points is studied. We wil1 show VLSI designs producing bounds close to the lower bounds also derived.