The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We study classes of Dynamic Programming (DP) algorithms which, due to their algebraic definitions, are closely related to coefficient extraction methods. DP algorithms can easily be modified to exploit sparseness in the DP table through memorization. Coefficient extraction techniques on the other hand are both space-efficient and parallelisable, but no tools have been available to exploit sparseness. We investigate the systematic use of homomorphic hash functions to combine the best of thesearXiv:1203.4063v1 fatcat:in5o4y77zrc2boiljz777ybbiq