Decompositions of graphs of functions and fast iterations of lookup tables
type: Item
instance of: scholarly article
title: Decompositions of graphs of functions and fast iterations of lookup tables
zbMATH Open document ID: 1113.05004
author: Boaz Tsaban
published in: Discrete Applied Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5130477
zbMATH Keywords: fast forward functions
zbMATH Keywords: fast forward permutations
zbMATH Keywords: cycle decomposition
zbMATH Keywords: cycle structure
MaRDI profile type: Publication
full work available at URL: j.dam.2006.06.006
OpenAlex ID: W1997195224
cites work: On the Implementation of Huge Random Objects
cites work: Constructing pseudo-random permutations with a prescribed structure
cites work: Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
DOI: 10.1016/J.DAM.2006.06.006
Recommended article: Q3364155
Recommended article: Q4243302
Recommended article: Q4318219
Recommended article: Fast Searching on Cartesian Products of Graphs
Recommended article: Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
Recommended article: Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Recommended article: Fast evaluation of interlace polynomials on graphs of bounded treewidth
Recommended article: Q4489161
Recommended article: Q3996407
Recommended article: Decomposition of graphs and monotone formula size of homogeneous functions
description: scientific article; zbMATH DE number 5130477