Decompositions of graphs of functions and fast iterations of lookup tables ?
We show that every function f  implemented as a lookup table can be implemented such that the computational complexity of evaluating fm(x) f m ( x ) is small, independently of m and x. The implementation only increases the storage space by a small constant factor.
fast forward functions fast forward permutations cycle decomposition cycle structure