Counting, Sampling and Integrating: Algorithms and Complexity
Algorithms and Complexity
(Sprache: Englisch)
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....
Leider schon ausverkauft
versandkostenfrei
Buch (Kartoniert)
69.54 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Counting, Sampling and Integrating: Algorithms and Complexity “
Klappentext zu „Counting, Sampling and Integrating: Algorithms and Complexity “
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 only to teachers of postgraduate courses on these topics, but also to established researchers. For the first time this body of knowledge has been brought together in a single volume.
Inhaltsverzeichnis zu „Counting, Sampling and Integrating: Algorithms and Complexity “
- Two Good Counting Algorithms- #P-completeness
- Sampling and Counting
- Coupling and Colourings
- Canonical Paths and Matchings
- Volume of a Convex Body
- Inapproximability
Bibliographische Angaben
- Autor: Mark Jerrum
- 2003, 2003, 112 Seiten, Maße: 17,8 x 25,4 cm, Kartoniert (TB), Englisch
- Verlag: Springer
- ISBN-10: 3764369469
- ISBN-13: 9783764369460
- Erscheinungsdatum: 23.01.2003
Sprache:
Englisch
Kommentar zu "Counting, Sampling and Integrating: Algorithms and Complexity"
0 Gebrauchte Artikel zu „Counting, Sampling and Integrating: Algorithms and Complexity“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Counting, Sampling and Integrating: Algorithms and Complexity".
Kommentar verfassen