Counting, Sampling and Integrating: Algorithms and Complexity by Mark Jerrum.
The subject of these notes is counting (of combinatorial structures) and related topics, viewed from a computational perspective. "Related topics" include sampling combinatorial structures (being computationally equivalent to approximate counting via efficient reductions), evaluating parti...
Full description
Saved in: