Discrete probability theory and the theory of algorithms have
become close partners over the last ten years, though the roots of
this partnership go back much longer. The papers in this volume
address the latest developments in this active field. They are from
the IMA Workshops "Probability and Algorithms" and "The Finite
Markov Chain Renaissance." They represent the current thinking of
many of the world's leading experts in the field.
Researchers and graduate students in probability, computer
science, combinatorics, and optimization theory will all be
interested in this collection of articles. The techniques developed
and surveyed in this volume are still undergoing rapid development,
and many of the articles of the collection offer an expositionally
pleasant entree into a research area of growing importance.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!