The Secret Santa Problem (Q3511435): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126420952 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4845472 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Derangements, Permanents, and Christmas Presents / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Latest revision as of 12:19, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Secret Santa Problem |
scientific article |
Statements
The Secret Santa Problem (English)
0 references
10 July 2008
0 references
