Klik op een omslag om naar Google Boeken te gaan.
Bezig met laden... The Golden Ticket: P, NP, and the Search for the Impossibledoor Lance Fortnow
Geen Bezig met laden...
Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden. Op dit moment geen Discussie gesprekken over dit boek. 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. 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. geen besprekingen | voeg een bespreking toe
PrijzenOnderscheidingen
"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"-- Geen bibliotheekbeschrijvingen gevonden. |
Actuele discussiesGeen
Google Books — Bezig met laden... GenresDewey Decimale Classificatie (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicLC-classificatieWaarderingGemiddelde:
Ben jij dit?Word een LibraryThing Auteur. |
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. ( )