The best choice problem for posets; colored complete binary trees (Q5963606)

From MaRDI portal
Revision as of 12:01, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6544293
Language Label Description Also known as
English
The best choice problem for posets; colored complete binary trees
scientific article; zbMATH DE number 6544293

    Statements

    Identifiers