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 f m(x) is small, independently of m and x. The implementation only increases the storage space by a small constant factor. © 2006 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: DAM
• Authors: Boaz Tsaban
• Keywords: Computational Complexity, DAM 2007, Lookup Table, Small Constant Factor