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

By:

Goldreich, Oded

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

9780521122542 (Paper)
0521122546 (Paper)

Subject(s):

DDC classification:

005.1

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Carti	IMAR	II 36899 (Browse shelf(Opens below))	Checked out	04/18/2025	0030450

Browsing IMAR shelves Close shelf browser (Hides shelf browser)

Previous					No cover image available			Next
Previous	II 36896 Fundamentals of mathematical logic	II 36897 Proof theory and automated deduction	II 36898 Reasoning about uncertainty	II 36899 P, NP, and NP-completeness the basics of computational complexity	II 369 Sur les espaces metriques non holonomes complementaires	II 36900 Computational complexity: a modern approach	II 36901 Principles of model checking	Next

Contine bibliogr. si 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.