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

By:

Goldreich, Oded

Material type: Text

TextPublication details: New York : Cambridge University Press, 2010.Description: xxix, 184 p. : ill. ; 24 cmISBN:

0521122546 (pbk.)
052119248X (hardback)
9780521122542 (pbk.)
9780521192484 (hardback)

Subject(s):

DDC classification:

22 005.1

LOC classification:

QA267.7 .G652 2010

Online resources:

Cover image

Contents:

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.

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"--Provided by publisher.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Home library	Call number	Copy number	Status	Date due	Barcode
Book	Dept. of Computer Science	Dept. of Computer Science	511.3 (Browse shelf(Opens below))	1	Available		DCS3952

Browsing Dept. of Computer Science shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available No cover image available						No cover image available No cover image available	Next
Previous	401.410285 The theory and practice of Discourse parsing and summarization	423 Oxford advanced Learners dictonary for current english	511.3 A computational introduction to number theory and algebra /	511.3 P, NP, and NP-completeness : the basics of computational complexity /	511.3 Ubiquitous computing fundamentals /	511.352 Computational complexity : a modern approach /	514.742 Fractals for the classroom Part 1; introduction to fractals and chaos	Next

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"--Provided by publisher.

There are no comments on this title.

to post a comment.