Algorithms Random Generation Counting by Sinclair (40 results)

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. …

Hardback. Condition: Very Good. 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.

Hardback. Condition: Very Good. 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.

146 S./pp., Originalpappband (publisher's cardboard covers), (Progress in Theoretical Computer Science), Sprache: englisch.

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.…

Original Boards. Condition: New. No Dust Jacket. First Edition. In original shrinkwrap.; Octavo; 155 pages.

Hardcover. Condition: Near Fine. 1st Edition. hardback book in near fine condition.

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: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

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.

Condition: Used. pp. 160.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: Used. pp. 160 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Condition: Used. pp. 160.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. 2012. Paperback. . . . . .

Condition: New. In English.

Condition: New.

Gebunden. Condition: New.

Condition: New. 1993. Hardcover. . . . . .

Condition: New. pp. 160.

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.…

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.…

Condition: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.

Condition: New. 1993. Hardcover. . . . . . Books ship from the US and Ireland.