Computational Complexity: A Quantitative Perspective, Volume 196 (North-Holland Mathematics Studies)

Description

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.
· Emphasis is on relevant quantitative attributes of important results in complexity.
· Coverage is self-contained and accessible to a wide audience.
· 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.

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Computational Complexity: A Quantitative Perspective, Volume 196 (North-Holland Mathematics Studies)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 2685
2. [share_ebook] Graphs and Questionnaires, Volume 32 (North-Holland Mathematics Studies)
3. Universal Spaces and Mappings, Volume 198 (North-Holland Mathematics Studies)
4. Differential Topology (North-Holland Mathematics Studies)
5. Hopf spaces (North-Holland mathematics studies 22)
6. Recent Topics in Nonlinear Pde III (North-Holland Mathematics Studies)
7. Topological Algebras with Involution (North-Holland Mathematics Studies)
8. Near-rings: The theory and its applications (North-Holland mathematics studies)
9. Induced Modules over Group Algebras (North-Holland Mathematics Studies)
10. Quantum Theory, Deformation and Integrability (North-Holland Mathematics Studies)
11. Half-Linear Differential Equations (North-Holland Mathematics Studies)
12. Analysis and Design of Algorithms for Combinatorial Problems (North-Holland Mathematics Studies)
13. Foundations of Analysis over Surreal Number Fields (North-Holland Mathematics Studies)
14. Hewitt-Nachbin Spaces (North-Holland mathematics studies): Maurice D Weir
15. Generalized Solutions of Nonlinear Partial Differential Equations (North-Holland Mathematics Studies)
16. Combinatorics 1981: Combinatorial Geometrics and Their Applications: Colloquium Proceedings (North-Holland mathematics studies)