2 research outputs found
Decompositions of graphs of functions and efficient 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 f^m(x) is
small, independently of m and x. The implementation only increases the storage
space by a small_constant_ factor.Comment: Small update