๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the equal-subset-sum problem

โœ Scribed by Gerhard J. Woeginger; Zhongliang Yu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
339 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New analytical results in subset-sum pro
New analytical results in subset-sum problem
โœ Gregory A Freiman ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 751 KB

Freiman, G.A., New analytical results in subset-sum problem, Discrete Mathematics 114 (1993) 205-218. An analytical method is developed to prove that, for the integer set k[l, I]. with I>/, and jAl=m>c,1"\*(log/) ) "2 the set A\* of subset sums contains a long arithmetic progression of length larger

More on the free subset problem
More on the free subset problem
โœ K.J. Devlin; J.B. Paris ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science โš– 468 KB
Exponentially small bounds on the expect
Exponentially small bounds on the expected optimum of the partition and subset sum problems
โœ George S. Lueker ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 172 KB

In the partition problem we seek to partition a list of numbers into two sublists to minimize the difference between the sums of the two sublists. For this and the related subset sum problem, under suitable assumptions on the probability distributions of the input, it is known that the median of the

On subset sums of r-sets
On subset sums of r-sets
โœ E. Lipkin ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 727 KB

Lipkin, E., On subset sums of r-sets, Discrete Mathematics 114 (1993) 3677377. A finite set of distinct integers is called an r-set if it contains at least r elements not divisible by 4 for each 4 > 2. Let f(n, r) denote the maximum cardinality of an r-set A c (1,2, , n} having no subset sum Caiai