𝔖 Scriptorium
✦   LIBER   ✦
📁

Counting, sampling and integrating: algorithms and complexity

✍ Scribed by Mark Jerrum

Publisher
Birkhäuser Basel
Year
2003
Tongue
English
Leaves
118
Series
Lectures in Mathematics. ETH Zürich
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

Математика;Дискретная математика;

📜 SIMILAR VOLUMES

Counting, Sampling and Integrating: Algo
📁 Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zürich)
✍ Mark Jerrum 📂 Library 🏛 Birkhäuser 🌐 English

<p><span>The subject of these notes is counting and related topics, viewed from a computational perspective. A major theme of the book is the idea of accumulating information about a set of combinatorial structures by performing a random walk on those structures. These notes will be of value not onl

Computational complexity of counting and
📁 Computational complexity of counting and sampling
✍ Miklós, István 📂 Library 📅 2019 🏛 CRC Press 🌐 English

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science. The book covers the

Computational Complexity of Counting and
📁 Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)
✍ Istvan Miklos 📂 Library 📅 2019 🏛 Chapman and Hall/CRC 🌐 English

<p><span>Computational Complexity of Counting and Sampling</span><span> provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science