Ebooks

Computational Complexity A Conceptual Perspective~tqw~ darksiderg

• 
• 
• Rate this torrent +  |  -

Torrent info

Torrent Files List

Torrent description

*******************************************************************************
Computational Complexity: A Conceptual Perspective
*******************************************************************************

-------------------------------------------------------------------------------
General Information
-------------------------------------------------------------------------------
Type.................: Ebook
Part Size............: 4,978,050 bytes




-------------------------------------------------------------------------------
Post Information
-------------------------------------------------------------------------------
Posted by............: ~tqw~

-------------------------------------------------------------------------------
Release Notes
-------------------------------------------------------------------------------
The quest for efficiency is ancient and universal, as time and other resources
are always in shortage. Thus, the question of which tasks can be performed
efficiently is central to the human experience. A key step toward the systematic
study of the aforementioned question is a rigorous definition of the notion of a
task and of procedures for solving tasks. These definitions were provided by
computability theory, which emerged in the 1930s. This theory focuses on
computational tasks, and considers automated procedures (i.e., computing devices
and algorithms) that may solve such tasks. In focusing attention on
computational tasks and algorithms, computability theory has set the stage for
the study of the computational resources (like time) that are required by such
algorithms. When this study focuses on the resources that are necessary for any
algorithm that solves a particular task (or a task of a particular type), the
study becomes part of the theory of Computational Complexity.

Table Of Contents

List of Figures page xiii
Preface xv
Organization and Chapter Summaries xvii
Acknowledgments xxiii
1 Introduction and Preliminaries 1
2 P, NP, and NP-Completeness 44
3 Variations on P and NP 108
4 More Resources, More Power? 127
5 Space Complexity 143
6 Randomness and Counting 184
7 The Bright Side of Hardness 241
8 Pseudorandom Generators 284
9 Probabilistic Proof Systems 349
10 Relaxing the Requirements 416
Epilogue 461
Appendix A: Glossary of Complexity Classes 463
Appendix B: On the Quest for Lower Bounds 469
Appendix C: On the Foundations of Modern Cryptography 482
Appendix D: Probabilistic Preliminaries and Advanced Topics in
Randomization 523
Appendix E: Explicit Constructions 545
Appendix F: Some Omitted Proofs 566
Appendix G: Some Computational Problems 583
Bibliography 589
Index 601

Product Details

* ISBN: 052188473X
* ISBN-13: 9780521884730
* Format: Hardcover, 632pp
* Publisher: Cambridge University Press
* Pub. Date: May 2008

-------------------------------------------------------------------------------
Install Notes
-------------------------------------------------------------------------------
PDF Reader

related torrents