Decompositions of graphs of functions and efficient iterations of lookup tables
Abstract
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating fm(x) is small, independently of m and x. The implementation only increases the storage space by a smallconstant factor.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.