This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size of coulmn entries which changes the complexity of the problem. Splitting the data into multiple columns greatly simplifies the task of solving the Subset Sum problem. However, other problems arise when we try to generate multiple columns. Here we try to find the optimal way to do the split and present the results. Our main goal was to try to solve the current hardest Subset Sum problem instances: the ones with density slightly greater than 1. Dramatic improvement in the rate of success was observed (up to 1500 %) compared to one- dimensional implementations.
Library of Congress Subject Headings
Computer algorithms; NP-complete problems; Lattice theory; Computational complexity
Department, Program, or Center
Computer Science (GCCIS)
Kolesnikov, Vladimir, "Multidimensional subset sum problem" (1997). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA76.9.A43 K64 1997