Computational complexity (Record no. 663)

000 -LEADER
fixed length control field 01880nam a2200217Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20241122113336.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 170804s2008 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521884730
040 ## - CATALOGING SOURCE
Original cataloging agency ICTS-TIFR
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267.7
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Oded Goldreich
245 ## - TITLE STATEMENT
Title Computational complexity
Remainder of title : a conceptual perspective
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Name of publisher, distributor, etc. Cambridge University Press,
Date of publication, distribution, etc. [c2008]
Place of publication, distribution, etc. U.K.:
300 ## - Physical Description
Pages: 606 p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 1 - Introduction and Preliminaries <br/>2 - P, NP, and NP-Completeness <br/>3 - Variations on P and NP <br/>4 - More Resources, More Power? <br/>5 - Space Complexity <br/>6 - Randomness and Counting <br/>7 - The Bright Side of Hardness <br/>8 - Pseudorandom Generators <br/>9 - Probabilistic Proof Systems <br/>10 - Relaxing the Requirements
520 ## - SUMMARY, ETC.
Summary, etc. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. --- summary provided by publisher
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational Geometry
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Book
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Shelving location Date acquired Full call number Accession No. Koha item type
          ICTS Rack No 5 01/19/2017 QA267.7 00663 Book