𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the expressiveness of subset-sum representations

✍ Scribed by Lucian Ilie; Arto Salomaa

Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
77 KB
Volume
36
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the equal-subset-sum problem
On the equal-subset-sum problem
✍ Gerhard J. Woeginger; Zhongliang Yu πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 339 KB
On variations of the subset sum problem
On variations of the subset sum problem
✍ J.L. RamΓ­rez AlfonsΓ­n πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 371 KB

In the well-known Subset Sum Problem, we are given positive integers a,, , a, and t and are to determine if some subset of the ai sums to t. We investigate the boundary between easy and hard variations of this problem. In particular, we consider the cases where the sequence 'A,~ .L' a,, \_\_\_ ,an i

On Optimal Subset Representations of Int
On Optimal Subset Representations of Integer Sets
✍ Mike Develin πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 121 KB

In this paper, we investigate representations of sets of integers as subset sums of other sets of minimal size, achieving results on the nature of the representing set as well as providing several reformulations of the problem. We apply one of these reformulations to prove a conjecture and extend a

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