Gå direkte til innholdet
Algorithms for Random Generation and Counting: A Markov Chain Approach
Spar

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.
Forfatter
A. Sinclair
Opplag
Softcover reprint of the original 1st ed. 1993
ISBN
9781461267072
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
1.11.2012
Antall sider
147