Optimal random bit complexity in efficient sampling of set partition-like structures (Q6876375)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8143484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal random bit complexity in efficient sampling of set partition-like structures |
scientific article; zbMATH DE number 8143484 |
Statements
Optimal random bit complexity in efficient sampling of set partition-like structures (English)
0 references
13 January 2026
0 references
random sampling
0 references
combinatorics
0 references
set partition
0 references
entropy-efficient
0 references
optimal randomness complexity
0 references
0 references
0 references
