Sums of lexicographically ordered sets (Q912760): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sets of Integers Whose Subsets Have Distinct Sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unsolved problems in number theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer Sets with Distinct Subset-Sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hiding information and signatures in trapdoor knapsacks / rank | |||
Normal rank |
Latest revision as of 15:33, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sums of lexicographically ordered sets |
scientific article |
Statements
Sums of lexicographically ordered sets (English)
0 references
1990
0 references
Given a set \(A=\{a_ 1,..,a_ n\}\) of distinct positive integers where \(a_ i<a_{i+1}\), \(i=1,...,n-1\). The knapsack problem on A is the problem of determining for any integer b whether b can be expressed as a sum of distinct elements and, if so, of identifying such elements. The authors consider the problem of determining sets A which are knapsack- solvable in linear time (for any integer b) and where the largest element is as small as possible. This is done by studying the condition that the k-subsets (for fixed k) of A when lexicographically ordered have increasing sums, and by constructing such sets.
0 references
linear solvability
0 references
knapsack problem
0 references