Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)

Russ Bubley

ISBN 10: 1852333251 / ISBN 13: 9781852333256

Published by Springer-Verlag London Ltd, 2000

About this Item

Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Couverture différente. Edition 2000. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Different cover. Edition 2000. Ammareal gives back up to 15% of this item's net price to charity organizations.

Seller Inventory # D-484-671

Bibliographic Details

• Title: Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)
• Publisher: Springer-Verlag London Ltd
• Publication Date: 2000
• Language: English
• ISBN 10: 1852333251
• ISBN 13: 9781852333256
• Binding: Hardcover
• Condition: Très bon

About this title

Synopsis

Randomized Algorithms discusses two problems of fine counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.