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. $79.48, new condition, Sold by Literary Cat Books rated 2.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. $90.03, new condition, Sold by discount_scientific_books rated 5.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. $101.58, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1993 by Birkhäuser.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $112.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2012 by Birkhauser.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $112.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1993 by Birkhauser.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $117.95, new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 1993 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 147 p. Contains: Unspecified. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $122.42, new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2012 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 147 p. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $122.77, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1993 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 147 p. Contains: Unspecified. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Algorithms for Random Generation and Counting: A Markov to cart. $127.63, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 147 p. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
