| 查看: 177 | 回复: 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 ] |
回复此楼» 猜你喜欢
浙江师范大学是怎么坑我的
已经有10人回复
-
浙江师范大学是怎么坑我的
已经有3人回复
-
求教各位大神：2026教育部人文社科青年基金项目何时公示呀？
已经有6人回复
-
面上有专家说实验设备不是我们单位的
已经有8人回复
-
科研求助
已经有4人回复
-
博士去二本高校当辅导员，如何调整心态？
已经有11人回复
-
江苏省自然基金 什么时候出结果
已经有6人回复
-
闲聊
已经有3人回复