Hardcover Edition practically Brand New except for a small abrasion to the front flyeaf. The covers are in great shape. The binding is square and tight. The interior pages are clean and unmarked. The book will be carefully packaged for shipment for protection from the elements. USPS electronic tracking number issued free of charge. Seller Inventory # 14908

Contact seller

Report this item

Bibliographic Details

Title: Algorithms for Random Generation and ...

Publisher: Birkh�user, Boston

Binding: Hardcover

Condition: As New

Dust Jacket Condition: No Jacket

Edition: First Edition.

About this title

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.

Synopsis:

A study of two classical computational problems that not only amuse mathematicians, but also arise in the natural sciences: counting the elements of a finite set of combinatorial structures; and generating them at random from some probability distribution. Of interest to researchers and graduate students in theoretical computer science who are work

"About this title" may belong to another edition of this title.

Store Description

Alien Bindings is an online bookshop located in Baltimore that has been in operation for nearly 20 years. Alien Bindings caters to the sciences including the physical sciences, astronomy, mathematics, computer science, the social sciences and medicine. I also dabble in a wide array of other categories including antiquarian books and history. I run a clean, green business. I try to reuse clean materials for packaging whenever possible. For example, books are carefully packaged frequently using clean cardboard for custom made boxes, recycled paper is used for printed labels and recycled plastic or bubble wrap is used for a weather-proof barrier. I drop the packages off to my local post office via foot or cycle in order to further reduce the carbon footprint.

Visit Seller's Storefront