Computational complexity (Record no. 21828)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05459cam a2200697Ia 4500 |
| 001 - CONTROL NUMBER | |
| control field | ocm60747122 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OCoLC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20141103172225.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
| fixed length control field | m o d |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu---unuuu |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 050627s2004 ne ob 001 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | |
| Language of cataloging | eng |
| Description conventions | pn |
| Transcribing agency | N$T |
| Modifying agency | OCLCQ |
| -- | YDXCP |
| -- | OCLCQ |
| -- | OPELS |
| -- | MERUC |
| -- | E7B |
| -- | MHW |
| -- | IDEBK |
| -- | TULIB |
| -- | EBLCP |
| -- | OCLCO |
| -- | OCLCQ |
| -- | OPELS |
| -- | OCLCF |
| -- | DEBBG |
| -- | OCLCQ |
| 016 7# - NATIONAL BIBLIOGRAPHIC AGENCY CONTROL NUMBER | |
| Record control number | 012875863 |
| Source | Uk |
| 019 ## - | |
| -- | 162589313 |
| -- | 171131241 |
| -- | 441778489 |
| -- | 648257609 |
| -- | 779919593 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 1423709357 (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781423709350 (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780444828415 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0444828419 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 008047666X (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780080476667 (electronic bk.) |
| 029 1# - (OCLC) | |
| OCLC library identifier | AU@ |
| System control number | 000048129837 |
| 029 1# - (OCLC) | |
| OCLC library identifier | AU@ |
| System control number | 000050767366 |
| 029 1# - (OCLC) | |
| OCLC library identifier | DEBBG |
| System control number | BV036962370 |
| 029 1# - (OCLC) | |
| OCLC library identifier | NZ1 |
| System control number | 12435192 |
| 029 1# - (OCLC) | |
| OCLC library identifier | NZ1 |
| System control number | 15192802 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)60747122 |
| Canceled/invalid control number | (OCoLC)162589313 |
| -- | (OCoLC)171131241 |
| -- | (OCoLC)441778489 |
| -- | (OCoLC)648257609 |
| -- | (OCoLC)779919593 |
| 037 ## - SOURCE OF ACQUISITION | |
| Stock number | 107979:108021 |
| Source of stock number/acquisition | Elsevier Science & Technology |
| Note | http://www.sciencedirect.com |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267.7 |
| Item number | .Z55 2004eb |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM |
| Subject category code subdivision | 037000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | QA |
| Source | lcco |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.352 |
| Edition number | 22 |
| 049 ## - LOCAL HOLDINGS (OCLC) | |
| Holding library | TEFA |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Zimand, Marius. |
| 245 10 - TITLE STATEMENT | |
| Title | Computational complexity |
| Medium | [electronic resource] : |
| Remainder of title | a quantitative perspective / |
| Statement of responsibility, etc. | Marius Zimand. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Amsterdam ; |
| -- | Boston : |
| Name of publisher, distributor, etc. | Elsevier, |
| Date of publication, distribution, etc. | 2004. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (xii, 340 pages). |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 490 1# - SERIES STATEMENT | |
| Series statement | North-Holland mathematics studies, |
| International Standard Serial Number | 0304-0208 ; |
| Volume/sequential designation | 196 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references (pages 321-332) and index. |
| 588 0# - SOURCE OF DESCRIPTION NOTE | |
| Source of description note | Print version record. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | COMPUTERS |
| General subdivision | Machine Theory. |
| Source of heading or term | bisacsh |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| Source of heading or term | fast |
| Authority record control number | (OCoLC)fst00871991 |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Print version: |
| Main entry heading | Zimand, Marius. |
| Title | Computational complexity. |
| Edition | 1st ed. |
| Place, publisher, and date of publication | Amsterdam ; Boston : Elsevier, 2004 |
| International Standard Book Number | 0444828419 |
| Record control number | (OCoLC)56057801 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | North-Holland mathematics studies ; |
| Volume number/sequential designation | 196. |
| International Standard Serial Number | 0304-0208 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Materials specified | ScienceDirect |
| Uniform Resource Identifier | <a href="http://www.sciencedirect.com/science/book/9780444828415">http://www.sciencedirect.com/science/book/9780444828415</a> |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Materials specified | ScienceDirect |
| Uniform Resource Identifier | <a href="http://www.sciencedirect.com/science/publication?issn=03040208&volume=196">http://www.sciencedirect.com/science/publication?issn=03040208&volume=196</a> |
| 938 ## - | |
| -- | EBL - Ebook Library |
| -- | EBLB |
| -- | EBL293527 |
| 938 ## - | |
| -- | ebrary |
| -- | EBRY |
| -- | ebr10177014 |
| 938 ## - | |
| -- | EBSCOhost |
| -- | EBSC |
| -- | 132247 |
| 938 ## - | |
| -- | Ingram Digital eBook Collection |
| -- | IDEB |
| -- | 100891 |
| 938 ## - | |
| -- | YBP Library Services |
| -- | YANK |
| -- | 2356992 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E(electronic)-Books |
| 994 ## - | |
| -- | C0 |
| -- | TEF |
No items available.
