Several Remarks on Index Generation Functions
Dan A. Simovici, Marius Zimand, Dan Pletea · 2012
We propose a probabilistic greedy algorithm for decomposing partially specified index generation functions. These functions have numerous applications in a variety of circuit design problems. We show that finding an optimal decomposition is an intractable problem, which motivates our approach.