Combinatorics of note

2020-07-18 — 2020-07-18

compsci
Monte Carlo
probabilistic algorithms
pseudorandomness
stringology
Wherein combinatorial connections between algorithmic complexity and quasi-Monte Carlo are considered, and Jörg Arndt’s Matters Computational is cited as a referenced resource for further computational examples.

Algorithmic complexity and quasi Monte Carlo both consider combinatorial matters too.