115
Voted
DAM
2007
15 years 3 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 ...