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