Cargando…
Algorithms for random generation and counting: a Markov chain approach
This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic interest, these problems arise naturally in many branches of mathematics and th...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Birkhäuser
1993
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1459571 |
| Sumario: | This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic interest, these problems arise naturally in many branches of mathematics and the natural sciences. |
|---|