| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420128 | Discrete Applied Mathematics | 2007 | 8 Pages |
Abstract
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating fm(x)fm(x) is small, independently of m and x. The implementation only increases the storage space by a small constant factor.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Boaz Tsaban,