Skip to main content
PBS logo
 
 

Search - Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)

Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Algorithms for Random Generation and Counting A Markov Chain Approach - Progress in Theoretical Computer Science
Author: A. Sinclair
This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic interest, these problems arise naturally in many branches of mathematics and the natural sciences. The author aims to class...  more »
ISBN-13: 9783764336585
ISBN-10: 3764336587
Publication Date: 12/31/1996
Pages: 146
Rating:
  ?
0 stars, based on 0 rating
Publisher: Birkhauser Verlag AG
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.