Screen LibraryComputational complexity : a quantitative perspective /
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...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Published: |
Elsevier,
|
| Publisher Address: | Amsterdam ; Boston : |
| Publication Dates: | 2004. |
| Literature type: | eBook |
| Language: | English |
| Edition: | First edition. |
| Series: |
North-Holland mathematics studies,
196 |
| Subjects: | |
| Online Access: |
http://www.sciencedirect.com/science/bookseries/03040208/196 |
| Summary: |
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 analys |
| Carrier Form: | 1 online resource (xii, 340 pages). |
| Bibliography: | Includes bibliographical references (pages 321-332) and index. |
| ISBN: |
1423709357 9781423709350 9780444828415 0444828419 008047666X 9780080476667 |
| Index Number: | QA267 |
| CLC: | O141 |
| 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. |