Integer Sets with Distinct Subset-Sums (Q3800132): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3311639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of lexicographically ordered sets / rank
 
Normal rank

Latest revision as of 18:51, 18 June 2024

scientific article
Language Label Description Also known as
English
Integer Sets with Distinct Subset-Sums
scientific article

    Statements

    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    computational number theory
    0 references
    Richardson extrapolation
    0 references
    Knapsack problem
    0 references
    backtrack search
    0 references
    divide-and-conquer
    0 references
    Subset Sum Distinctness
    0 references
    SSD
    0 references
    Atkinson-Negro-Santoro sequence
    0 references
    Conway-Guy sequence
    0 references
    minimal SSD sets
    0 references
    MACSYMA
    0 references
    Multidimensional Continued Fraction algorithm
    0 references
    0 references
    0 references
    0 references
    Integer Sets with Distinct Subset-Sums (English)
    0 references