Algorithms for Random Generation and Counting: A Markov Chain Approach
This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that sol…
Mehr
CHF 171.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
- ISBN: 978-1-4612-6707-2
- EAN: 9781461267072
- Produktnummer: 14587122
- Verlag: Birkhäuser Boston
- Sprache: Englisch
- Erscheinungsjahr: 2012
- Seitenangabe: 160 S.
- Masse: H23.8 cm x B15.4 cm x D1.2 cm 256 g
- Auflage: Softcover reprint of the original 1st ed. 1993
- Abbildungen: Paperback
- Gewicht: 256
17 weitere Werke von A. Sinclair:
Bewertungen
Anmelden