Theory of computational complexity / (Record no. 64628)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06835cam a2200865 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | sulb-eb0032976 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | BD-SySUS |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20170713221350.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 ||||||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 131204s2014 nju ob 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER | |
| LC control number | 2013048402 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | DLC |
| Language of cataloging | eng |
| Description conventions | rda |
| -- | pn |
| Transcribing agency | DLC |
| Modifying agency | BTCTA |
| -- | CUS |
| -- | OCLCF |
| -- | EBLCP |
| -- | YDXCP |
| -- | N$T |
| -- | DG1 |
| -- | E7B |
| -- | COO |
| -- | UMI |
| -- | DEBBG |
| -- | DEBSZ |
| -- | OCLCQ |
| -- | BD-SySUS |
| 019 ## - | |
| -- | 880827316 |
| -- | 890704289 |
| -- | 908035677 |
| -- | 961539877 |
| -- | 962565147 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781118594971 |
| Qualifying information | (epub) |
| International Standard Book Number | 1118594975 |
| Qualifying information | (epub) |
| International Standard Book Number | 9781118593035 |
| Qualifying information | (pdf) |
| International Standard Book Number | 1118593030 |
| Qualifying information | (pdf) |
| International Standard Book Number | 9781118032916 |
| Qualifying information | (online) |
| International Standard Book Number | 1118032918 |
| Qualifying information | (online) |
| International Standard Book Number | 9781118595091 |
| International Standard Book Number | 1118595092 |
| Canceled/invalid ISBN | 9781118306086 |
| Qualifying information | (cloth) |
| Canceled/invalid ISBN | 0471345067 |
| Qualifying information | (print) |
| Canceled/invalid ISBN | 1118306082 |
| 029 1# - OTHER SYSTEM CONTROL NUMBER (OCLC) | |
| OCLC library identifier | AU@ |
| System control number | 000052313344 |
| OCLC library identifier | CHBIS |
| System control number | 010259700 |
| OCLC library identifier | CHVBK |
| System control number | 325941793 |
| OCLC library identifier | DEBBG |
| System control number | BV042182590 |
| OCLC library identifier | DEBSZ |
| System control number | 417232748 |
| OCLC library identifier | NZ1 |
| System control number | 15592017 |
| OCLC library identifier | DEBBG |
| System control number | BV043396388 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)864753086 |
| Canceled/invalid control number | (OCoLC)880827316 |
| -- | (OCoLC)890704289 |
| -- | (OCoLC)908035677 |
| -- | (OCoLC)961539877 |
| -- | (OCoLC)962565147 |
| 037 ## - SOURCE OF ACQUISITION | |
| Stock number | CL0500000480 |
| Source of stock number/acquisition | Safari Books Online |
| 042 ## - AUTHENTICATION CODE | |
| Authentication code | pcc |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267.7 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT |
| Subject category code subdivision | 000000 |
| Source | bisacsh |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.3/52 |
| Edition number | 23 |
| 049 ## - LOCAL HOLDINGS (OCLC) | |
| Holding library | MAIN |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Du, Dingzhu, |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Theory of computational complexity / |
| Statement of responsibility, etc. | Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | Second edition. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Hoboken, New Jersey : |
| Name of producer, publisher, distributor, manufacturer | John Wiley & Sons, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2014. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource. |
| 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 | Wiley-Interscience series in discrete mathematics and optimization |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 588 0# - SOURCE OF DESCRIPTION NOTE | |
| Source of description note | Print version record and CIP data provided by publisher. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Cover; Title Page; Contents; Preface; Notes on the Second Edition; Part I Uniform Complexity; Chapter 1 Models of Computation and Complexity Classes; 1.1 Strings, Coding, and Boolean Functions; 1.2 Deterministic Turing Machines; 1.3 Nondeterministic Turing Machines; 1.4 Complexity Classes; 1.5 Universal Turing Machine; 1.6 Diagonalization; 1.7 Simulation; Exercises; Historical Notes; Chapter 2 NP-Completeness; 2.1 NP; 2.2 Cook's Theorem; 2.3 More NP-Complete Problems; 2.4 Polynomial-Time Turing Reducibility; 2.5 NP-Complete Optimization Problems; Exercises; Historical Notes. |
| Formatted contents note | Chapter 3 The Polynomial-Time Hierarchy and Polynomial Space3.1 Nondeterministic Oracle Turing Machines; 3.2 Polynomial-Time Hierarchy; 3.3 Complete Problems in PH; 3.4 Alternating Turing Machines; 3.5 PSPACE-Complete Problems; 3.6 EXP-Complete Problems; Exercises; Historical Notes; Chapter 4 Structure of NP; 4.1 Incomplete Problems in NP; 4.2 One-Way Functions and Cryptography; 4.3 Relativization; 4.4 Unrelativizable Proof Techniques; 4.5 Independence Results; 4.6 Positive Relativization; 4.7 Random Oracles; 4.8 Structure of Relativized NP; Exercises; Historical Notes. |
| Formatted contents note | Part II Nonuniform ComplexityChapter 5 Decision Trees; 5.1 Graphs and Decision Trees; 5.2 Examples; 5.3 Algebraic Criterion; 5.4 Monotone Graph Properties; 5.5 Topological Criterion; 5.6 Applications of the Fixed Point Theorems; 5.7 Applications of Permutation Groups; 5.8 Randomized Decision Trees; 5.9 Branching Programs; Exercises; Historical Notes; Chapter 6 Circuit Complexity; 6.1 Boolean Circuits; 6.2 Polynomial-Size Circuits; 6.3 Monotone Circuits; 6.4 Circuits with Modulo Gates; 6.5 NC; 6.6 Parity Function; 6.7 P-Completeness; 6.8 Random Circuits and RNC; Exercises; Historical Notes. |
| Formatted contents note | Chapter 7 Polynomial-Time Isomorphism7.1 Polynomial-Time Isomorphism; 7.2 Paddability; 7.3 Density of NP-Complete Sets; 7.4 Density of EXP-Complete Sets; 7.5 One-Way Functions and Isomorphism in EXP; 7.6 Density of P-Complete Sets; Exercises; Historical Notes; Part III Probabilistic Complexity; Chapter 8 Probabilistic Machines and Complexity Classes; 8.1 Randomized Algorithms; 8.2 Probabilistic Turing Machines; 8.3 Time Complexity of Probabilistic Turing Machines; 8.4 Probabilistic Machines with Bounded Errors; 8.5 BPP and P; 8.6 BPP and NP; 8.7 BPP and the Polynomial-Time Hierarchy. |
| Formatted contents note | 8.8 Relativized Probabilistic Complexity ClassesExercises; Historical Notes; Chapter 9 Complexity of Counting; 9.1 Counting Class #P; 9.2 #P-Complete Problems; 9.3 oplus P and the Polynomial-Time Hierarchy; 9.4 #P and the Polynomial-Time Hierarchy; 9.5 Circuit Complexity and Relativized oplus P and #P; 9.6 Relativized Polynomial-Time Hierarchy; Exercises; Historical Notes; Chapter 10 Interactive Proof Systems; 10.1 Examples and Definitions; 10.2 Arthur-Merlin Proof Systems; 10.3 AM Hierarchy Versus Polynomial-Time Hierarchy; 10.4 IP Versus AM; 10.5 IP Versus PSPACE; Exercises. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| Topical term or geographic name as entry element | Computational complexity. |
| Topical term or geographic name as entry element | MATHEMATICS |
| General subdivision | General. |
| Source of heading or term | bisacsh |
| Topical term or geographic name as entry element | Computational complexity. |
| Source of heading or term | fast |
| Authority record control number | (OCoLC)fst00871991 |
| Topical term or geographic name as entry element | Computational complexity. |
| Source of heading or term | local |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Ko, Ker-I, |
| Relator term | author. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Print version: |
| Main entry heading | Du, Dingzhu, author. |
| Title | Theory of computational complexity. |
| Edition | Second edition. |
| Place, publisher, and date of publication | Hoboken, New Jersey : John Wiley & Sons, Inc., 2014 |
| International Standard Book Number | 9781118306086 |
| Record control number | (DLC) 2013047839 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Wiley-Interscience series in discrete mathematics and optimization. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://onlinelibrary.wiley.com/book/10.1002/9781118595091">http://onlinelibrary.wiley.com/book/10.1002/9781118595091</a> |
| Public note | Wiley Online Library [Free Download only for SUST IP] |
| 938 ## - | |
| -- | Baker and Taylor |
| -- | BTCP |
| -- | BK0014181124 |
| -- | EBL - Ebook Library |
| -- | EBLB |
| -- | EBL1695068 |
| -- | ebrary |
| -- | EBRY |
| -- | ebr10876079 |
| -- | EBSCOhost |
| -- | EBSC |
| -- | 784130 |
| -- | YBP Library Services |
| -- | YANK |
| -- | 11828286 |
| -- | YBP Library Services |
| -- | YANK |
| -- | 11072126 |
| -- | YBP Library Services |
| -- | YANK |
| -- | 12672917 |
| 994 ## - | |
| -- | 92 |
| -- | DG1 |
No items available.