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

By:

Goldreich, Oded

Material type: Text

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780511909443
0511909446
9780511906657
051190665X
1282797662
9781282797666
9780511761355
051176135X
1139929771
9781139929776
9786612797668
6612797665
0511908687
9780511908682
0511905378
9780511905377
0511907931
9780511907937

Subject(s): Genre/Form:

Additional physical formats: Print version:: P, NP, and NP-completeness.DDC classification:

005.1 22

LOC classification:

QA267.7 .G652 2010eb

Online resources:

Click here to access online

Contents:

Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- 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.

Item type:

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

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

Includes bibliographical references (pages 181-182) and index.

Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory.