North South University Library OPAC

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

MARC details
000 -LEADER
fixed length control field 01862nam a2200289 a 4500
001 - CONTROL NUMBER
control field BD-DhNSU-22116
003 - CONTROL NUMBER IDENTIFIER
control field BD-DhNSU
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20211018112355.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 211018s2010 nyua|||g |||| 001 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521122542
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency BD-DhNSU
Modifying agency BD-DhNSU
041 ## - LANGUAGE CODE
Language code of text eng
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267.7
Item number .G65 2010
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Goldreich, Oded
-- 23474
245 00 - TITLE STATEMENT
Title P, NP, and NP-completeness :
Remainder of title the basics of computational complexity /
Statement of responsibility, etc. Oded Goldreich
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York :
Name of publisher, distributor, etc. Cambridge University Press,
Date of publication, distribution, etc. c2010.
300 ## - PHYSICAL DESCRIPTION
Extent xxix, 184 p. :
Other physical details ill. ;
Dimensions 22+ cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
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"
526 0# - STUDY PROGRAM INFORMATION NOTE
Program name Computer Science & Engineering
590 ## - LOCAL NOTE (RLIN)
Documentalist Dilruba Rahman
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational complexity
-- 1510
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms
-- 23475
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Approximation theory
-- 23476
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Polynomials.
-- 23477
999 ## - SYSTEM CONTROL NUMBERS (KOHA)
-- 22116
-- 22116
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme lcc
Koha item type BK
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Code Permanent Location Current Location Shelving location Date acquired Source of acquisition (Supplier) Currency Bill Code Call Number Barcode (Accession #) Copy number Item type
    lcc     Non-fiction North South University Library North South University Library General Stacks 2012-06-20 Trim Education ৳ (BDT) 204/12 QA267.7.G65 2010 35303 1 Books
© 2017-2024 NSU Library
North South University

Powered by Koha