Gå direkt till innehållet
Algorithms for Random Generation and Counting: A Markov Chain Approach
Spara

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.
Författare
A. Sinclair
Upplaga
Softcover reprint of the original 1st ed. 1993
ISBN
9781461267072
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2012-11-01
Sidor
147