Decompositions of graphs of functions and efficient iterations of lookup tables
arXiv:cs/0508133 · doi:10.1016/j.dam.2006.06.006
Abstract
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.
Small updates