| 查看: 136 | 回复: 0 | ||
| 当前主题已经存档。 | ||
[资源]
Design and Analysis of Randomized Algorithms
|
||
|
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) * Publisher: Springer * Number Of Pages: 284 * Publication Date: 2005-07-22 * Sales Rank: 446785 * ISBN / ASIN: 3540239499 * EAN: 9783540239499 * Binding: Hardcover * Manufacturer: Springer * Studio: Springer * Average Rating: * Total Reviews: Book Description: ) Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities. Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field. [ Last edited by cuplgz on 2007-5-3 at 11:34 ] |
回复此楼» 猜你喜欢
遇见不省心的家人很难过
已经有19人回复
-
退学或坚持读
已经有25人回复
-
博士延得我，科研能力直往上蹿
已经有4人回复
-
免疫学博士有名额，速联系
已经有14人回复
-
面上基金申报没有其他的参与者成吗
已经有4人回复
-
多组分精馏求助
已经有6人回复