Jump to ContentJump to Main Navigation
The Golden TicketP, NP, and the Search for the Impossible$
Users without a subscription are not able to see the full content.

Lance Fortnow

Print publication date: 2017

Print ISBN-13: 9780691175782

Published to Princeton Scholarship Online: May 2018

DOI: 10.23943/princeton/9780691175782.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 24 February 2020

The Beautiful World

The Beautiful World

Chapter:
(p.11) Chapter 2 The Beautiful World
Source:
The Golden Ticket
Author(s):

Lance Fortnow

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691175782.003.0002

This chapter examines an efficient algorithm that solves NP problems, the Urbana algorithm. With the Urbana algorithm one can solve all the NP problems quickly, finding the simplest program that classifies data becomes an easy programming exercise. All one needs do is feed in lots of data and the algorithm does the rest. And that lets one learn just about everything. If it turns out that P = NP and the world has efficient algorithms for all NP problems, it will change in ways that will make the Internet seem like a footnote in history. Not only would it be impossible to describe all these changes but the biggest implications of the new technologies would be impossible to predict.

Keywords:   algorithm, NP problems, Urbana algorithm, programming, Internet, new technologies

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.