{"product_id":"9781447111801","title":"Randomized Algorithms: Approximation, Generation, and Counting","description":"\u003ch1\u003eRandomized Algorithms: Approximation, Generation, and Counting\u003c\/h1\u003e \u003ch2\u003eBubley, Russ\u003c\/h2\u003e \u003cp\u003e\u003cb\u003eRandomized Algorithms\u003c\/b\u003e discusses two problems of fine pedigree: 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. \u003cb\u003eRandomized Algorithms\u003c\/b\u003e 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2011-09-16\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003e ISBN-10: 9781447111801\u003c\/p\u003e \u003cp\u003eISBN-13: 9781447111801\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4471-0695-1\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 152\u003c\/p\u003e ","brand":"Springer","offers":[{"title":"Default Title","offer_id":44341243412620,"sku":"9781447111801","price":99.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781447111801.jpg?v=1755041186","url":"https:\/\/lateknightbooks.com\/products\/9781447111801","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}