Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (5 chapters)
-
Front Matter
-
Back Matter
About this book
Authors and Affiliations
-
Department of Computer Science, University of Edinburgh, Edinburgh, Scotland
Alistair Sinclair
Bibliographic Information
Book Title: Algorithms for Random Generation and Counting: A Markov Chain Approach
Authors: Alistair Sinclair
Series Title: Progress in Theoretical Computer Science
DOI: https://doi.org/10.1007/978-1-4612-0323-0
Publisher: Birkhäuser Boston, MA
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1993
Hardcover ISBN: 978-0-8176-3658-6
Softcover ISBN: 978-1-4612-6707-2
eBook ISBN: 978-1-4612-0323-0
Edition Number: 1
Number of Pages: VIII, 147
Topics: Math Applications in Computer Science, Probability Theory and Stochastic Processes, Algorithm Analysis and Problem Complexity, Algorithms, Computational Mathematics and Numerical Analysis, Applications of Mathematics