Computational Complexity

出版者:Cambridge University Press

作者:Oded Goldreich

页数:632

出版时间:2008-4-28

价格:USD 79.00

装帧:Hardcover

isbn号码:9780521884730

图书标签:Complexity计算机科学计算机Computation数学TCSComputational变分法7

Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.

用户评价

有时间会写一个评论

有时间会写一个评论

有时间会写一个评论

有时间会写一个评论

风格很独特，着重于解释各个概念的motivation，以及它们之间的联系。不太关心technical detail，只对一些主要定理提供了证明。跟Arora & Barak反差特别大，适合一起读。