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 ...
Read More
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.
Read Less
Add this copy of Algorithms for Random Generation and Counting: a Markov to cart. $26.50, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1993 by Birkhäuser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Algorithms for Random Generation and Coun to cart. $59.70, very good condition, Sold by Dotcom liquidators / dc1 rated 4.0 out of 5 stars, ships from Fort Worth, TX, UNITED STATES, published 1993 by Birkhauser.
Add this copy of Algorithms for Random Generation and Counting: a Markov to cart. $65.39, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1993 by Birkhäuser.
Add this copy of Algorithms for Random Generation and Counting: a Markov to cart. $70.49, like new condition, Sold by Alien Bindings rated 5.0 out of 5 stars, ships from BALTIMORE, MD, UNITED STATES, published 1993 by Birkhäuser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. 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. 146 pages.
Add this copy of Algorithms for Random Generation and Counting: a Markov to cart. $72.00, very good condition, Sold by BingoBooks2 rated 4.0 out of 5 stars, ships from Vancouver, WA, UNITED STATES, published 1993 by Secaucus, New Jersey, U.S.A. : Birkhauser.
Add this copy of Algorithms for Random Generation and Counting. a Markov to cart. $83.43, new condition, Sold by Literary Cat Books rated 3.0 out of 5 stars, ships from Machynlleth, Powys, WALES, UNITED KINGDOM, published 1993 by Birkhäuser.
Add this copy of Algorithms for Random Generation and Counting-a Markov to cart. $84.67, new condition, Sold by discount_scientific_books rated 3.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1993 by Birkhauser.
Add this copy of Algorithms for Random Generation and Counting-a Markov to cart. $88.26, new condition, Sold by discount_scientific_books rated 3.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1993 by Birkhauser.
Add this copy of Algorithms for Random Generation and Counting: a Markov to cart. $94.58, new condition, Sold by GridFreed rated 4.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1993 by Birkhäuser.
