Decompositions of graphs of functions and efficient iterations of lookup tables

Details Decompositions of graphs of functions and efficient iterations of lookup tables Decompositions of graphs of functions and efficient iterations of lookup tables

2005-08-31

arxiv.org/abs/cs/0508133v4

Discrete Applied Mathematics 155 (2007), 386--393

Computer Science

Computational Complexity

Small updates

Scientific paper

10.1016/j.dam.2006.06.006

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.

Affiliated with

Also associated with

No associations

Rating

Decompositions of graphs of functions and efficient iterations of lookup tables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decompositions of graphs of functions and efficient iterations of lookup tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of graphs of functions and efficient iterations of lookup tables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116361