New item Free shipping Pay Now
Add this item to Cart for a combined free shipping deal
Click to enlarge photo

Listing Detail Tabs

This item has FREE SHIPPING to any address in NZ

NOTE: Item will ship from our US warehouse. A handling time of 2-4 business days applies for all orders. Delivery will then take 3-10 working days.

Algorithms for Random Generation and Counting: A Markov Chain Approach

Condition: BRAND NEW
ISBN: 9781461267072
Author(s): A. Sinclair
Format: Hardcover
Year: 2012
Edition: 93199th
Publisher: Birkhäuser
Dimensions: 155 x 13 x 235 (w x l x h)
Pages: 160
Series: Progress in Theoretical Computer Science

BUYER OFFERS: We are a retail store with set pricing and unfortunately we can't fulfil any requests to sell items for less than the listed price.

Description:
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.

About Us:
T Please click here to ask a question
Your question and answer privileges have been disabled.
You must log in to view questions and answers on this listing. We recommend reading questions before you make any purchases.
Please log in to view questions and answers on this listing. We recommend reading questions before you make any purchases. Available only to approved bidders. You must be an authenticated member to ask questions Find out more about becoming authenticated. Your account is in debt Your current account balance is You must credit your account to use this feature.
Firearms Licence #
By entering my licence number, I confirm I am aware of my obligations under the Arms Act.
Transaction details may be provided to police in accordance with the Terms & Conditions.
Your current account balance is Please note you will lose your question and answer privileges if your account is in debt for more than 2 weeks. Credit your account.
I confirm that I am over 18 years old.
To prevent your personal details being misused please do not put emails or phone numbers in questions. Failure to comply may result in the suspension of your account. The seller cannot add a Buy Now price once bidding has started.

Shipping options

  • Free shipping within New Zealand  
  • Store does not allow pick-ups
  • Store location: Auckland City, Auckland, NZ

Payment options

  • NZ bank deposit