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...

Descripción completa

Detalles Bibliográficos
Autor principal: Sinclair, Alistair
Lenguaje:eng
Publicado: Birkhäuser 1993
Materias:
Acceso en línea:http://cds.cern.ch/record/1459571
_version_ 1780925194198581248
author Sinclair, Alistair
author_facet Sinclair, Alistair
author_sort Sinclair, Alistair
collection CERN
description 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.
id cern-1459571
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1993
publisher Birkhäuser
record_format invenio
spelling cern-14595712021-04-22T00:26:07Zhttp://cds.cern.ch/record/1459571engSinclair, AlistairAlgorithms for random generation and counting: a Markov chain approachComputing and ComputersThis 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.Birkhäuseroai:cds.cern.ch:14595711993
spellingShingle Computing and Computers
Sinclair, Alistair
Algorithms for random generation and counting: a Markov chain approach
title Algorithms for random generation and counting: a Markov chain approach
title_full Algorithms for random generation and counting: a Markov chain approach
title_fullStr Algorithms for random generation and counting: a Markov chain approach
title_full_unstemmed Algorithms for random generation and counting: a Markov chain approach
title_short Algorithms for random generation and counting: a Markov chain approach
title_sort algorithms for random generation and counting: a markov chain approach
topic Computing and Computers
url http://cds.cern.ch/record/1459571
work_keys_str_mv AT sinclairalistair algorithmsforrandomgenerationandcountingamarkovchainapproach