An extremal problem for subset-sum-distinct sequences with congruence conditions
type: Item
instance of: scholarly article
title: An extremal problem for subset-sum-distinct sequences with congruence conditions
zbMATH Open document ID: 0951.11010
DOI: 10.1016/S0012-365X(97)00221-5
author: Jaegug Bae
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 11B75
zbMATH DE Number: 1524945
zbMATH Keywords: subset-sum-distinct sequence
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
cites work: Q4004078
cites work: Q4885298
cites work: Q4222560
cites work: On Weird and Pseudoperfect Numbers
cites work: A sum packing problem of Erdös and the Conway-Guy sequence
cites work: An improved lower bound on the greatest element of a sum-distinct set of fixed order
cites work: Q3234565
cites work: Q3872528
cites work: Q4312862
cites work: Sets of Integers Whose Subsets Have Distinct Sums
cites work: Shorter Notes: Distinct Sums over Subsets
cites work: Integer Sets with Distinct Subset-Sums
Wikidata QID: Q126812431
description: scientific article; zbMATH DE number 1524945