Golden ticket P, NP and the search for the impossible

By:

Fortnow, Lance

Material type: Text

TextLanguage: English Publication details: New jersey Princeton university press 2013Description: x, 176p. illISBN:

9780691156491 (HB)

Subject(s):

Contents:

ch. 1 The Golden Ticket ch. 2 The Beautiful World ch. 3 P and NP ch. 4 The Hardest Problems in NP ch. 5 The Prehistory of P versus NP ch. 6 Dealing with Hardness ch. 7 Proving P [≠] NP ch. 8 Secrets ch. 9 Quantum ch. 10 The Future.

Summary: The P versus NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. This text provides a nontechnical introduction to P versus NP, its rich history, and its algorithmic implications for everything we do with computers and beyond.

Item type:

BOOKS

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

Average rating: 0.0 (0 votes)

Holdings
Home library	Call number	Materials specified	Status	Date due	Barcode
IMSc Library	519.16 FOR (Browse shelf(Opens below))		Available		69687
IMSc Library	519.16 FOR (Browse shelf(Opens below))		Available		68299

Includes index

Includes bibliographical references

The P versus NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. This text provides a nontechnical introduction to P versus NP, its rich history, and its algorithmic implications for everything we do with computers and beyond.

There are no comments on this title.

to post a comment.

Place hold
Print
Send to device
Save record
BIBTEX Dublin Core RIS MARC (Unicode/UTF-8, Standard)
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)