DAM
2007
13 years 4 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...