P, NP, and NP-completeness : (Record no. 301205)

MARC details
000 -LEADER
fixed length control field 02701cam a2200397ua 4500
001 - CONTROL NUMBER
control field 16271898
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220105002303.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120703s2010 nyua b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2010023587
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0521122546 (pbk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 052119248X (hardback)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521122542 (pbk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521192484 (hardback)
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)ocn642204747
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency DLC
Modifying agency YDX
-- CDX
-- YDXCP
-- DLC
042 ## - AUTHENTICATION CODE
Authentication code pcc
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267.7
Item number .G652 2010
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Edition number 22
Classification number 005.1
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Goldreich, Oded.
245 ## - TITLE STATEMENT
Title P, NP, and NP-completeness :
Remainder of title the basics of computational complexity /
Statement of responsibility, etc. Oded Goldreich.
Medium Textual Documents
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York :
Name of publisher, distributor, etc. Cambridge University Press,
Date of publication, distribution, etc. 2010.
300 ## - PHYSICAL DESCRIPTION
Extent xxix, 184 p. :
Other physical details ill. ;
Dimensions 24 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.
520 ## - SUMMARY, ETC.
Summary, etc. "The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P-versus-NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete"--Provided by publisher.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Approximation theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Polynomials.
856 42 - ELECTRONIC LOCATION AND ACCESS
Materials specified Cover image
Uniform Resource Identifier <a href="http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg">http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg</a>
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN)
a 7
b cbc
c orignew
d 1
e ecip
f 20
g y-gencatlg
925 0# -
-- acquire
-- 2 shelf copies
-- policy default
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Book
955 ## - COPY-LEVEL INFORMATION (RLIN)
-- xh09 2010-06-15 to Dewey
-- rc09 2010-11-29 Z-CipVer
-- rc09 2010-11-29 c. 2 added
-- rd14 2010-06-15
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
        Dept. of Computer Science Dept. of Computer Science   12/12/2019   511.3 DCS3952 12/12/2019 1 12/12/2019 Book