Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
- 18 July 2025
- book chapter
- Published by Springer Nature
- p. 405-417
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- New approximations to the principal real-valued branch of the Lambert W-functionAdvances in Computational Mathematics, 2017
- A note on generating random variables with log-concave densitiesStatistics & Probability Letters, 2012
- Uniform Random Generation of Huge Metamodel Instances2009
- Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energyJournal of Mathematical Biology, 2007
- Uniform random generation of decomposable structures using floating-point arithmeticTheoretical Computer Science, 1999
- On Convergence Rates in the Central Limit Theorems for Combinatorial StructuresEuropean Journal of Combinatorics, 1998
- A simple generator for discrete log-concave distributionsComputing, 1987
- On the complexity of calculating factorialsJournal of Algorithms, 1985
- Generation of a random partition of a finite set by an urn modelJournal of Combinatorial Theory, Series A, 1983
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948