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.

N� de ref. del art�culo 14908

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Editor: Birkh�user, Boston
Idioma: Ingl�s
ISBN 10: 0817636587
ISBN 13: 9780817636586
Encuadernaci�n: Hardcover
Edici�n: First Edition.
Impresi�n: 2nd Printing
Estado: As New
Estado de la sobrecubierta: No Jacket
Dimensiones: 9,5�pulgadas de ancho por 6,25 de alto por 0,5 de largo

Acerca de

Sinopsis

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

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Alien Bindings is an online bookshop located in Baltimore that has been in operation for nearly 20 years. Alien Bindings caters to the sciences including the physical sciences, astronomy, mathematics, computer science, the social sciences and medicine. I also dabble in a wide array of other categories including antiquarian books and history. I run a clean, green business. I try to reuse clean materials for packaging whenever possible. For example, books are carefully packaged frequently using clean cardboard for custom made boxes, recycled paper is used for printed labels and recycled plastic or bubble wrap is used for a weather-proof barrier. I drop the packages off to my local post office via foot or cycle in order to further reduce the carbon footprint.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Alien Bindings
MD, U.S.A.

Condiciones de venta y env�o

Condiciones de venta

Derecho a cancelaci�n

Condiciones de env�o

Tarifas de env�o en Estados Unidos de America

Tarifas de env�o en Estados Unidos de America
Cantidad del pedido	De 4 a 14 d�as h�biles	De 3 a 6 d�as h�biles
Primer art�culo	EUR 0.00	EUR 8.60

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.