IniciGrupsConversesMésTendències
Cerca al lloc
Aquest lloc utilitza galetes per a oferir els nostres serveis, millorar el desenvolupament, per a anàlisis i (si no has iniciat la sessió) per a publicitat. Utilitzant LibraryThing acceptes que has llegit i entès els nostres Termes de servei i política de privacitat. L'ús que facis del lloc i dels seus serveis està subjecte a aquestes polítiques i termes.

Resultats de Google Books

Clica una miniatura per anar a Google Books.

S'està carregant…

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

de Lance Fortnow

MembresRessenyesPopularitatValoració mitjanaConverses
1083251,854 (3.32)Cap
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--… (més)
Cap
S'està carregant…

Apunta't a LibraryThing per saber si aquest llibre et pot agradar.

No hi ha cap discussió a Converses sobre aquesta obra.

Es mostren totes 3
Muy decepcionante. El libro parece tratar en principio sobre el problema de P y NP, pero lo que el autor tiene que contar sobre la materia es tan poco que hay decenas de páginas de relleno. Hay partes de relleno muy divertidas e interesantes, como la completísima historia de ficción en la que se demuestra que P=NP y por tanto todo problema computacional puede reducirse a otro problema resoluble en tiempo polinómico. El autor hace en esa historia un fantástico ejercicio de imaginación comparable, creo al de alguien a quien le pidieran en 1970 qué pasaría si todo el mundo tuviera a acceso a internet.
Pero luego nos llegan las disgresiones, la introducción a los algoritmos de cifrado(sin relacionarlos mucho con P=NP), la criptografía cuántica (para la que de momento no hay mucho armamento algorítmico puesto en producción)... y otras cosas que me hacen echar de menos el tema principal del libro. Un poco disperso, vaya. Lo que cuenta es interesante pero yo esperaba algo más técnico y más centrado en el tema principal. ( )
  Remocpi | Apr 22, 2020 |
The famous unsolved "P=NP?" theoretical problem in computer science (and mathematics) basically asks whether every computational problem whose solutions can be quickly checked also has the property that the solutions can be quickly generated in the first place. Though believed and assumed to be false, no disproof (or awarding of the million-dollar prize therefor) is in sight. Fortnow offers a (perhaps too) informal and pretty short exposition of the problem, its importance, related topics, and practical implications. An appendix, not included, could have explained that the technical criterion for problem-solving tractability is running time proportional to some polynomial function (not exponential or factorial) of the size of the input data.
  fpagan | Oct 12, 2013 |
A rare popular science book about the P vs NP problem. The author takes care in using concrete examples and simplifying explanations as much as possible, though I think at times he makes it too simple. I especially liked that he included the history of how the problem developed on both sides of the iron curtain during the cold war. This book may be a nice read for people who don't have much of a science or math background, but for those who do I don't think they will get enough out of it compared with just reading some wikipedia articles. ( )
  haig51 | Apr 19, 2013 |
Es mostren totes 3
Sense ressenyes | afegeix-hi una ressenya
Has d'iniciar sessió per poder modificar les dades del coneixement compartit.
Si et cal més ajuda, mira la pàgina d'ajuda del coneixement compartit.
Títol normalitzat
Títol original
Títols alternatius
Data original de publicació
Gent/Personatges
Llocs importants
Esdeveniments importants
Pel·lícules relacionades
Epígraf
Dedicatòria
Primeres paraules
Citacions
Darreres paraules
Nota de desambiguació
Editor de l'editorial
Creadors de notes promocionals a la coberta
Llengua original
CDD/SMD canònics
LCC canònic

Referències a aquesta obra en fonts externes.

Wikipedia en anglès

Cap

"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--

No s'han trobat descripcions de biblioteca.

Descripció del llibre
Sumari haiku

Debats actuals

Cap

Cobertes populars

Dreceres

Valoració

Mitjana: (3.32)
0.5
1
1.5
2 2
2.5
3 3
3.5 2
4 3
4.5 1
5

Ets tu?

Fes-te Autor del LibraryThing.

 

Quant a | Contacte | LibraryThing.com | Privadesa/Condicions | Ajuda/PMF | Blog | Botiga | APIs | TinyCat | Biblioteques llegades | Crítics Matiners | Coneixement comú | 204,507,685 llibres! | Barra superior: Sempre visible