Jump to ContentJump to Main Navigation

You are looking at 1-3 of 3 items

  • Keywords: P versus NP problem x
Clear All Modify Search

View:

Proving P ≠ NP

Lance Fortnow

in The Golden Ticket: P, NP, and the Search for the Impossible

Published in print:
2017
Published Online:
May 2018
ISBN:
9780691175782
eISBN:
9781400846610
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691175782.003.0007
Subject:
Computer Science, Programming

This chapter focuses on a few of the ideas that people have tried to solve the P versus NP problem. These have not panned out to anything close to a solution to the problem. To prove P ≠ NP one needs ... More


The Golden Ticket

Lance Fortnow

in The Golden Ticket: P, NP, and the Search for the Impossible

Published in print:
2017
Published Online:
May 2018
ISBN:
9780691175782
eISBN:
9781400846610
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691175782.003.0001
Subject:
Computer Science, Programming

This introductory chapter provides an overview of the P versus NP problem. The P versus NP problem asks, among other things, whether one can quickly find the shortest route for a traveling salesman. ... More


The Golden Ticket: P, NP, and the Search for the Impossible

Lance Fortnow

Published in print:
2017
Published Online:
May 2018
ISBN:
9780691175782
eISBN:
9781400846610
Item type:
book
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691175782.001.0001
Subject:
Computer Science, Programming

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


View: