Description: Algorithms for Random Generation and Counting : A Markov Chain Approach, Hardcover by Sinclair, Alistair, ISBN 0817636587, ISBN-13 9780817636586, Like New Used, Free shipping in the US 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 working with probability and statistics. Annotation copyright Book News, Inc. Portland, Or.
Price: 125.27 USD
Location: Jessup, Maryland
End Time: 2024-10-26T01:32:52.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Book Title: Algorithms for Random Generation and Counting : A Markov Chain Ap
Number of Pages: VIII, 147 Pages
Publication Name: Algorithms for Random Generation and Counting : a Markov Chain Approach
Language: English
Publisher: Birkhäuser Boston
Publication Year: 1993
Subject: Programming / Algorithms, Probability & Statistics / Stochastic Processes, Probability & Statistics / General, Algebra / General, Applied
Type: Textbook
Item Weight: 31.7 Oz
Author: A. Sinclair
Item Length: 9.3 in
Subject Area: Mathematics, Computers
Item Width: 6.1 in
Series: Progress in Theoretical Computer Science Ser.
Format: Hardcover
