Abstract
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose order-1 coef.cients are small in size (a few bits only) can be computed. We compare the obtained results with similar work in the recent literature.