Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Algorithms for Random Generation and Counting: A Markov Chain Approach

Name: Algorithms for Random Generation and Counting: A Markov Chain Approach
Brand: Springer, Basel
SKU: 01399015
Price: 539.32 RON
Availability: InStock
Author: A. Sinclair
ISBN: 9780817636586

A Markov Chain Approach

A. Sinclair

Limba

engleză

Carte Copertă tare

Codul Libristo: 01399015

Editura Springer, Basel, noiembrie 1992

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of... Descrierea completă

Codul Libristo: 01399015

249 b

539.32 lei

În depozitul extern Expediem în 10-13 zile

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

Ljudski rod: Povijest čovječnosti Rutger Bregman

Copertă tare

121.37 lei

Все закончится на нас Колин Гувер

Carte broșată

78.13 lei

Maman, je veux connaître ton histoire Casey Parker

Carte broșată

75.12 lei

Boh nám daroval Vianoce Lisa Tawn Bergren

Copertă tare

55.59 lei

Cesta manažéra z pekla Andrej Kiska

Carte broșată

24.41 lei

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.