Algorithms for Random Generation and Counting: A Markov Chain Approach / Najlacnejšie knihy
Algorithms for Random Generation and Counting: A Markov Chain Approach

Code: 01399015

Algorithms for Random Generation and Counting: A Markov Chain Approach

by A. Sinclair

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. So ... more

122.07 €


Low in stock at our supplier
Shipping in 10 - 15 days

Potřebujete více kusů?Máte-li zájem o více kusů, prověřte, prosím, nejprve dostupnost titulu na naši zákaznické podpoře.


Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Algorithms for Random Generation and Counting: A Markov Chain Approach

You get 304 loyalty points

Book synopsis

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 solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

122.07 €

Trending among others

All about us



Shopping guide
Digest
Books by language
Payment
Delivery 2.99 €

Collection points Bratislava a 2642 dalších

Slovensko
България Hrvatska România Magyarország Polska Česko

Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies

Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: