Computational Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024


Computational Complexity

簡體網頁||繁體網頁
Zimand, Marius 作者
Elsevier Science Ltd
譯者
2004-7 出版日期
352 頁數
$ 237.30 價格
HRD
North-Holland Mathematics Studies 叢書系列
9780444828415 圖書編碼

Computational Complexity 在線電子書 圖書標籤:  


喜歡 Computational Complexity 在線電子書 的讀者還喜歡




點擊這裡下載
    


想要找書就要到 圖書目錄大全
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

發表於2024-11-13

Computational Complexity 在線電子書 epub 下載 mobi 下載 pdf 下載 txt 下載 2024

Computational Complexity 在線電子書 epub 下載 pdf 下載 mobi 下載 txt 下載 2024

Computational Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024



Computational Complexity 在線電子書 用戶評價

評分

評分

評分

評分

評分

Computational Complexity 在線電子書 著者簡介


Computational Complexity 在線電子書 著者簡介


Computational Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 在線電子書下載

Computational Complexity 在線電子書 圖書描述

There has been a common perception that computational complexity is a theory of 'bad news' because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, 'bad news' is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a 'bad news' result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines. It places emphasis on relevant quantitative attributes of important results in complexity. Its coverage is self-contained and accessible to a wide audience. It features large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology.

Computational Complexity 在線電子書 下載 mobi epub pdf txt 在線電子書下載


想要找書就要到 圖書目錄大全
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

Computational Complexity 在線電子書 讀後感

評分

評分

評分

評分

評分

類似圖書 點擊查看全場最低價

Computational Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024


分享鏈接





Computational Complexity 在線電子書 相關圖書




本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

友情鏈接

© 2024 book.wenda123.org All Rights Reserved. 圖書目錄大全 版權所有