书目名称 | Randomized Algorithms: Approximation, Generation, and Counting | 编辑 | Russ Bubley | 视频video | | 丛书名称 | Distinguished Dissertations | 图书封面 |  | 描述 | .Randomized Algorithms. 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. .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. | 出版日期 | Book 2001 | 关键词 | Discrete Mathematics; Erfüllbarkeitsproblem der Aussagenlogik; Markov Chain; Monte Carlo Method; Path Co | 版次 | 1 | doi | https://doi.org/10.1007/978-1-4471-0695-1 | isbn_softcover | 978-1-4471-1180-1 | isbn_ebook | 978-1-4471-0695-1 | copyright | Springer-Verlag London Limited 2001 |
The information of publication is updating
书目名称Randomized Algorithms: Approximation, Generation, and Counting影响因子(影响力) 
书目名称Randomized Algorithms: Approximation, Generation, and Counting影响因子(影响力)学科排名 
书目名称Randomized Algorithms: Approximation, Generation, and Counting网络公开度 
书目名称Randomized Algorithms: Approximation, Generation, and Counting网络公开度学科排名 
书目名称Randomized Algorithms: Approximation, Generation, and Counting被引频次 
书目名称Randomized Algorithms: Approximation, Generation, and Counting被引频次学科排名 
书目名称Randomized Algorithms: Approximation, Generation, and Counting年度引用 
书目名称Randomized Algorithms: Approximation, Generation, and Counting年度引用学科排名 
书目名称Randomized Algorithms: Approximation, Generation, and Counting读者反馈 
书目名称Randomized Algorithms: Approximation, Generation, and Counting读者反馈学科排名 
|
|
|