Abstract

In this thesis, we investigate numerous algorithms that make use of boolean decompositions. We provide a new algorithm for computing the representatives of linear decompositions. These representatives are the indices for a table storing partial solutions, which is used by dynamic programming algorithms. These algorithms are parameterized by the width
... read more