Computational aspects of ordered integer partitions with bounds (Q2006947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4218535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Objective Combinatorial Optimization: Problematic and Context / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johann Faulhaber and Sums of Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of multiple choice balls-into-bins: tight bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balls in constrained urns and Cantor-like sets / rank
 
Normal rank

Revision as of 19:01, 23 July 2024

scientific article
Language Label Description Also known as
English
Computational aspects of ordered integer partitions with bounds
scientific article

    Statements

    Computational aspects of ordered integer partitions with bounds (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2020
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references