ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > SUBSET SUM:
Reports tagged with Subset Sum:
TR05-007 | 15th December 2004
Vadim Lyubashevsky

On Random High Density Subset Sums

In the Subset Sum problem, we are given n integers a_1,...,a_n and a target number t, and are asked to find the subset of the a_i's such that the sum is t. A version of the subset sum problem is the Random Modular Subset Sum problem. In this version, the ... more >>>



ISSN 1433-8092 | Imprint