Decompositions of graphs of functions and fast iterations of lookup tables

Boaz Tsaban

doi:10.1016/j.dam.2006.06.006

Decompositions of graphs of functions and fast iterations of lookup tables

Boaz Tsaban

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	386-393
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	155
Issue number	3
DOIs	https://doi.org/10.1016/j.dam.2006.06.006
State	Published - 1 Feb 2007
Externally published	Yes

Keywords

Cycle decomposition
Cycle structure
Fast forward functions
Fast forward permutations

Access to Document

10.1016/j.dam.2006.06.006

Cite this

@article{1c71c23ee708497496016ceb879ee665,

title = "Decompositions of graphs of functions and fast 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 small constant factor.",

keywords = "Cycle decomposition, Cycle structure, Fast forward functions, Fast forward permutations",

author = "Boaz Tsaban",

year = "2007",

month = feb,

day = "1",

doi = "10.1016/j.dam.2006.06.006",

language = "אנגלית",

volume = "155",

pages = "386--393",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Decompositions of graphs of functions and fast iterations of lookup tables

AU - Tsaban, Boaz

PY - 2007/2/1

Y1 - 2007/2/1

N2 - 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 small constant factor.

AB - 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 small constant factor.

KW - Cycle decomposition

KW - Cycle structure

KW - Fast forward functions

KW - Fast forward permutations

UR - https://www.scopus.com/pages/publications/33751181190

U2 - 10.1016/j.dam.2006.06.006

DO - 10.1016/j.dam.2006.06.006

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

SN - 0166-218X

VL - 155

SP - 386

EP - 393

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 3

ER -

Decompositions of graphs of functions and fast iterations of lookup tables

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this