Skip to main content
Book

Algorithms for Random Generation and Counting: A Markov Chain Approach

  • Sinclair A
Birkhäuser Boston, (1993)
DOI: 10.1007/978-1-4612-0323-0
N/ACitations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

'This book, aimed at graduate students and researchers in the theory of algorithms, succeeds admirably in describing the fundamental ideas in the field.' - Computing Reviews This monograph studies two classical computational problems: counting the eleme

Cite

CITATION STYLE

APA

Sinclair, A. (1993). Algorithms for Random Generation and Counting: A Markov Chain Approach. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-0323-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free