Combinatorics of note

2020-07-18 — 2020-07-18

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.

compsci

Monte Carlo

probabilistic algorithms

pseudorandomness

stringology

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

Jörg Arndt’s Matters Computational