Randomized Algorithms: Approximation, Generation and Counting
By: by Russ Bubley
Series: Distinguished Dissertations; Distinguished Dissertations
Publisher: Springer London
Published: 2001
Place of publication: London
Language: eng
Format: [electronic resource] /
Number of pages: 152
ISBN-13: 9781447106951
Table of contents: title: Mathematical Background; title: Techniques for Sampling and Approximate Sampling; title: Approximate Counting; title: Applications: Coupling; title: Intermezzo: Path Coupling; title: Applications: Path Coupling; title: Directions for Future Work; title: Appendix A: An Application of Dobrushin's Uniqueness Criterion; title: Appendix B: A Hierarchy of #Sat Restrictions; title: Appendix C: Equivalence of Transposition Distance To Spearman's Footrule; title: Bibliography; title: Index.