North South University Library OPAC

Amazon cover image
Image from Amazon.com

P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich

By: Material type: TextTextLanguage: English Publication details: New York : Cambridge University Press, c2010.Description: xxix, 184 p. : ill. ; 22+ cmISBN:
  • 9780521122542
Subject(s): LOC classification:
  • QA267.7 .G65 2010
Summary: "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"
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books North South University Library Non-fiction General Stacks QA267.7.G65 2010 (Browse shelf(Opens below)) 1 Available 35303

Includes bibliographical references and index.

"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"

Computer Science & Engineering

Dilruba Rahman

There are no comments on this title.

to post a comment.
© 2017-2024 NSU Library
North South University

Powered by Koha