Decompositions of graphs of functions and efficient iterations of lookup tables
classification
💻 cs.CC
cs.CR
keywords
implementedlookupsmallcomplexitycomputationalconstantdecompositionsefficient
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.