 |
|
| COMPUTATIONAL COMPLEXITY: A QUANTITATIVE PERSPECTIVE, 196
| |
| | |
|
|
To order this title, and for more information, click here
By
Marius Zimand, Townson University, Townson, USA.
Included in series
North-Holland Mathematics Studies, 196
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.
Audience
University libraries, researchers in the field theory of computation, computational complexity, algorithms, and al graduate students in computer science.
Contents
Contents
Preface.
1. Preliminaries.
2. Abstract complexity theory.
3. P, NP, and E.
4. Quantum computation.
5. One-way functions,
pseudo-random generators.
6. Optimization problems.
A. Tail bounds.
Bibliography.
Index.
| Bibliographic details |
Hardbound, 352 pages, publication date: JUL-2004
ISBN-13: 978-0-444-82841-5
ISBN-10: 0-444-82841-9
Imprint: ELSEVIER
|
| Price and Ordering |
Price:
USD 210
GBP 126.99
EUR 149.95
|  |
Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). USD prices apply to the Americas and Asia Pacific. EUR prices apply in Europe and the Middle East. GBP prices apply to the UK and all other countries.
|
See also information about conditions of sale & ordering procedures, and links to our regional sales offices.
|
050/500
Last update: 3 Oct 2009
|
|
| |
| | |
|
|
| |
Home | Elsevier Sites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company