| 查看: 155 | 回复: 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 ] |
回复此楼» 猜你喜欢
E0414, 我的本子有没有希望？
已经有9人回复
-
青A35岁以下通知答辩了吗
已经有3人回复
-
【全奖博士/科研助理/博后招生】新加坡南洋理工大学机械与航空航天学院
已经有4人回复
-
希望面上有个好结果
已经有7人回复
-
三区计算机方向期刊推荐
已经有5人回复
-
sci论文二审求助
已经有5人回复