Decompositions of graphs of functions and efficient iterations of lookup tables
<|reference_start|>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.<|reference_end|>
@article{tsaban2005decompositions,
    title={Decompositions of graphs of functions and efficient iterations of lookup
  tables},
    author={Boaz Tsaban},
    journal={Discrete Applied Mathematics 155 (2007), 386--393},
    year={2005},
    doi={10.1016/j.dam.2006.06.006},
    archivePrefix={arXiv},
    eprint={cs/0508133},
    primaryClass={cs.CC cs.CR}
}