Title of article
Decompositions of graphs of functions and fast iterations of lookup tables Original Research Article
Author/Authors
Boaz Tsaban، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
8
From page
386
To page
393
Abstract
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating image is small, independently of m and x. The implementation only increases the storage space by a small constant factor.
Keywords
Cycle structure , Fast forward functions , Cycle decomposition , Fast forward permutations
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886425
Link To Document