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-11-26


Computability and Complexity Theory 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

Computability and Complexity Theory 在线电子书 epub 下载 mobi 下载 pdf 下载 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. 图书目录大全 版权所有