Solving dense subset-sum problems by using analytical number theory

Abstract

Let A = {a,, . . . , a,,,}, ui E N. For B c A let SB = Co,EB ai and let A* = {SB 1 B C A}. Consider the following versions of the subset-sum problem. PROBLEM I. Given the set A and the target number M E N, find the maximal subset sum S E A* such that S I M. PROBLEM 2. In addition to finding S, find B C A such that Ss = S. Problems 1 and 2 are NP-hard (Garey… (More)
DOI: 10.1016/0885-064X(89)90025-3

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.