Computability and Complexity Theory 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024


Computability and Complexity Theory

簡體網頁||繁體網頁
Steven Homer 作者
Springer
譯者
2012-1-31 出版日期
314 頁數
USD 69.95 價格
Hardcover
叢書系列
9781461406815 圖書編碼

Computability and Complexity Theory 在線電子書 圖書標籤: 計算機科學  數學  TCS  Springer  2012  邏輯  計算機  CS   


喜歡 Computability and Complexity Theory 在線電子書 的讀者還喜歡




點擊這裡下載
    


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

發表於2024-12-23

Computability and Complexity Theory 在線電子書 epub 下載 mobi 下載 pdf 下載 txt 下載 2024

Computability and Complexity Theory 在線電子書 epub 下載 pdf 下載 mobi 下載 txt 下載 2024

Computability and Complexity Theory 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024



Computability and Complexity Theory 在線電子書 用戶評價

評分

不適閤初學者讀,復雜的概念隻用瞭極簡的數學公式來展示,P.S. springer的書都很爛。

評分

不適閤初學者讀,復雜的概念隻用瞭極簡的數學公式來展示,P.S. springer的書都很爛。

評分

不適閤初學者讀,復雜的概念隻用瞭極簡的數學公式來展示,P.S. springer的書都很爛。

評分

不適閤初學者讀,復雜的概念隻用瞭極簡的數學公式來展示,P.S. springer的書都很爛。

評分

不適閤初學者讀,復雜的概念隻用瞭極簡的數學公式來展示,P.S. springer的書都很爛。

Computability and Complexity Theory 在線電子書 著者簡介


Computability and Complexity Theory 在線電子書 著者簡介


Computability and Complexity Theory 在線電子書 pdf 下載 txt下載 epub 下載 mobi 在線電子書下載

Computability and Complexity Theory 在線電子書 圖書描述

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karpa"Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes

Computability and Complexity Theory 在線電子書 下載 mobi epub pdf txt 在線電子書下載


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

Computability and Complexity Theory 在線電子書 讀後感

評分

評分

評分

評分

評分

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

Computability and Complexity Theory 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024


分享鏈接





Computability and Complexity Theory 在線電子書 相關圖書




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

友情鏈接

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