Order Total (1 Item Items):
Shipping Destination:
Algorithms Random Generation Counting by Sinclair (34 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (34)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (25)
- As New, Fine or Near Fine (7)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
Collectible Attributes
- First Edition (3)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (14)
- Not Print on Demand (27)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Algorithms for random generation and counting: a Markov chain approach.
Published by Basel, Birkhäuser, ,, 1993
146 S./pp., Originalpappband (publisher's cardboard covers), (Progress in Theoretical Computer Science), Sprache: englisch.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
US$ 49.37
US$ 14.24 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Hardcover. Condition: As New. No Jacket. First Edition. 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.
-
Algorithms for Random Generation and Counting. a Markov Chain Approach (Progress in Theoretical Computer Science)
Language: English
Published by Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Seller: Literary Cat Books, Machynlleth, Powys, WALES, United Kingdom
Association Member: IOBA
Seller rating 3 out of 5 stars
First Edition
US$ 57.90
US$ 18.74 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketOriginal Boards. Condition: New. Dust Jacket Condition: No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Birkhauser Boston Inc, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Hardcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1993. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1993. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
First Edition
Hardcover. Condition: Near Fine. 1st Edition. hardback book in near fine condition.
-
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Language: English
Published by Birkhäuser (edition 1993), 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Hardcover. Condition: New. 1993. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: New. pp. 160.
-
-
-
-
US$ 114.26
US$ 8.70 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New. pp. 160 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Condition: New. pp. 160.
-
Condition: As New. Unread book in perfect condition.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 126.84
US$ 20.08 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 160.
-
US$ 111.44
US$ 57.44 shipping
Ships from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 111.44
US$ 57.44 shipping
Ships from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 148.54
US$ 20.08 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 164.05
US$ 33.46 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Taschenbuch. Condition: Neu. Algorithms for Random Generation and Counting: A Markov Chain Approach | A. Sinclair | Taschenbuch | viii | Englisch | 2012 | Birkhäuser | EAN 9781461267072 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Birkhäuser Boston, Birkhäuser Boston, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
US$ 188.87
US$ 33.46 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Birkhäuser Boston Feb 1993, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 160 pp. Englisch.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Language: English
Published by Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 160 pp. Englisch.
-
US$ 170.05
US$ 8.70 shipping
Ships from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 160 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
