Designing Markov Chains

No Wikipedia

1 courses cover this concept

CS 263 Counting and Sampling

Stanford University

Autumn 2022

The course addresses both classic and recent developments in counting and sampling. It covers counting complexity, exact counting via determinants, sampling via Markov chains, and high-dimensional expanders.

No concepts data

+ 52 more concepts