Siirry suoraan sisältöön
Algorithms for Random Generation and Counting: A Markov Chain Approach
Tallenna

Algorithms for Random Generation and Counting: A Markov Chain Approach

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.
Kirjailija
A. Sinclair
Painos
Softcover reprint of the original 1st ed. 1993
ISBN
9781461267072
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
1.11.2012
Sivumäärä
147