![]() |
Discrete Mathematics & Theoretical Computer Science |
Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.
Source : ScholeXplorer
IsRelatedTo ARXIV 0807.0992 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.0807.0992
|