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.

Rese�a del editor:

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Please come visit our shop in Machynlleth or browse our stock online. We carry a wide range of academic books on all subjects, such as history, philosophy, psychology, psychiatry, mathematics, physics, geography, political science, political philosophy, religious studies, military history and many other subjects. We also carry antiquarian stock and general stock, especially cookery. We are always interested in collections, especially on academic subjects.

Zur Homepage des Verk�ufers

Verbandsmitglied

Verbandsmitglieder verpflichten sich, h�chste Standards einzuhalten. Sie garantieren die Echtheit aller zum Verkauf angebotenen Objekte. Ihre Objektbeschreibungen sind sachkundig und genau, etwaig vorhandene M�ngel oder Restaurationen werden offengelegt. Die Ansetzung der Verkaufspreise erfolgt nach akkurater Recherche. Alle Verk�ufe werden stets fair und redlich abgewickelt.

Unternehmensdaten des Verk�ufers

Literary Cat Books
United Kingdom

Gesch�ftsbedingungen:

All orders of 50 pounds and higher will be shipped with mandatory insurance added.

We make every effort to describe each book or print accurately. However, we accept that an item might not prove to be as you expected it, or has been damaged in transport. We therefore accept returns within 14 days of receipt of the item, upon prior notification. We will provide a full refund upon receipt of the returned item by us.

Versandinformationen:

Orders usually ship within 2/3 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know if extra shipping is required.

Overseas postage will be sent by airmail if you select priority and surface if you select standard postage. Surface mail to the United States or Canada can take up to six weeks, and up to twelve weeks to Australia and New Zealand.

We use only good quality materials and the utmost care when packaging our books to ensure they arrive in the best possible condition.

In the unlikely event that your book does not arrive within the specified shipping period, please feel free to contact us direct. Please provide your name, address and the details of your order.

Zahlungsarten
akzeptiert von diesem Verk�ufer

Zu Kaufgesuchen hinzuf�gen

Verwandte Artikel zu Algorithms for Random Generation and Counting. a Markov...

Algorithms for Random Generation and Counting. a Markov Chain Approach (Progress in Theoretical Computer Science)

Sinclair, Alistair

Neu - Hardcover

Unternehmensdaten des Verk�ufers