24小时热门版块排行榜    

CyRhmU.jpeg
查看: 120  |  回复: 0
当前主题已经存档。

zhangjs

铁杆木虫 (职业作家)


[资源] 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 ]
回复此楼
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 zhangjs 的主题更新
☆ 无星级 ★ 一星级 ★★★ 三星级 ★★★★★ 五星级
普通表情 高级回复(可上传附件)
信息提示
请填处理意见