Photo 1/1
Lance Fortnow The Golden Ticket (livre de poche)
Another great item from Rarewaves USA | Free delivery!
État :
Plus de 10 disponibles
Livraison :
Lieu où se trouve l'objet : 60502, États-Unis
Délai de livraison :
Varie
Retours :
Retour sous 30 jours. L'acheteur paie les frais de retour. Afficher les détails- pour en savoir plus sur les retours
Paiements :
Achetez en toute confiance
Détails sur le vendeur
- 97,7% d'évaluations positives
Inscrit comme vendeur professionnel
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :335195204278
Dernière mise à jour le 03 mai 2024 19:19:39 CEST. Afficher toutes les modificationsAfficher toutes les modifications
Caractéristiques de l'objet
- État
- Book Title
- The Golden Ticket
- Publication Name
- Golden Ticket : P, Np, and the Search for the Impossible
- Title
- The Golden Ticket
- Subtitle
- P, NP, and the Search for the Impossible
- Format
- Trade Paperback
- ISBN-10
- 0691175780
- EAN
- 9780691175782
- ISBN
- 9780691175782
- Publisher
- Princeton University Press
- Genre
- Science Nature & Math
- Topic
- Computing & Internet
- Release Year
- 2017
- Release Date
- 28/02/2017
- Language
- English
- Country/Region of Manufacture
- US
- Item Height
- 0.9in
- Item Length
- 9.2in
- Item Weight
- 11 Oz
- Publication Year
- 2017
- Type
- Textbook
- Item Width
- 6.1in
- Number of Pages
- 192 Pages
À propos de ce produit
Product Information
The P-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. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.
Product Identifiers
Publisher
Princeton University Press
ISBN-10
0691175780
ISBN-13
9780691175782
eBay Product ID (ePID)
228894361
Product Key Features
Publication Name
Golden Ticket : P, Np, and the Search for the Impossible
Format
Trade Paperback
Language
English
Publication Year
2017
Type
Textbook
Number of Pages
192 Pages
Dimensions
Item Length
9.2in
Item Height
0.9in
Item Width
6.1in
Item Weight
11 Oz
Additional Product Features
Reviews
The definition of this problem is tricky and technical, but in The Golden Ticket , Lance Fortnow cleverly sidesteps the issue with a boiled-down version. P is the collection of problems we can solve quickly, NP is the collection of problems we would like to solve. If P = NP, computers can answer all the questions we pose and our world is changed forever. It is an oversimplification, but Fortnow, a computer scientist at Georgia Institute of Technology, Atlanta, knows his stuff and aptly illustrates why NP problems are so important. ---Jacob Aron, New Scientist, "The P-NP problem is fundamental to computer science, and indeed all of mathematics. This book presents an engaging exposition of the problem, its history, and importance. In the process, it touches on major topics appearing in university computer science courses, all presented in an amusing style requiring no background in mathematics beyond the ability to solve Sudoku puzzles. I highly recommend it." --Stephen Cook, formulator of the P-NP problem, "This book, written by a world-class master of the field, is a grand tour of the most celebrated and profound unsolved problem in computer science. Fortnow's many ingenious explanations make the mysteries of computational complexity accessible to anyone interested in the fundamental questions: what can be computed and how fast can we compute it?" --John MacCormick, author of Nine Algorithms That Changed the Future, Fortnow's book provides much of the background and personal information on the main characters involved in this problem--notably Steven Cook, with a cameo appearance by Kurt Gödel--that one does not get in the more technical treatments. There is a lot of information in this book, and the serious computer science student is sure to learn from it. ---James M. Cargal, UMAP Journal, [ The Golden Ticket ] is fun to read and can be fully appreciated without any knowledge in (theoretical) computer science. Fortnow's efforts to make the difficult material accessible to non-experts should be commended. ---Andreas Maletti, Zentralblatt MATH, "As Fortnow describes. . . P versus NP is 'one of the great open problems in all of mathematics' not only because it is extremely difficult to solve but because it has such obvious practical applications. It is the dream of total ease, of the confidence that there is an efficient way to calculate nearly everything, 'from cures to deadly diseases to the nature of the universe,' even 'an algorithmic process to recognize greatness.'. . . To postulate that P ≠NP, as Fortnow does, is to allow for a world of mystery, difficulty, and frustration--but also of discovery and inquiry, of pleasures pleasingly delayed." --Alexander Nazaryan, New Yorker, One of Amazon.com's 2013 Best Science Books One of Choice 's Outstanding Academic Titles for 2013 Honorable Mention for the 2013 PROSE Award in Popular Science & Mathematics, Association of American Publishers, A great book. . . . [Lance Fortnow] has written precisely the book about P vs. NP that the interested layperson or IT professional wants and needs. ---Scott Aaronson, Shtetl-Optimized blog, "This book is meticulous. Fortnow has really tracked down the history and background of this important and timely subject. Even complexity theorists will benefit from his fine scholarship. The Golden Ticket is the first of its kind--a book for general readers about complexity theory." --William Gasarch, University of Maryland, "Nobody explains the importance of the P-NP problem better than Fortnow." --William J. Cook, author of In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, Honorable Mention for the 2013 PROSE Award in Popular Science & Mathematics, Association of American Publishers, "Fortnow's book provides much of the background and personal information on the main characters involved in this problem--notably Steven Cook, with a cameo appearance by Kurt Gödel--that one does not get in the more technical treatments. There is a lot of information in this book, and the serious computer science student is sure to learn from it." --James M. Cargal, UMAP Journal, "You will love this book. It's completely accessible and captures the thrill, potential, and heartbreak of an edgy mathematical problem in terms that nonmathematicians will appreciate. After reading The Golden Ticket , I sort of hope P isn't NP after all." --Vint Cerf, Internet Pioneer, In any case, it is excellent to have a nontechnical book about the P versus NP question. The Golden Ticket offers an inspiring introduction for nontechnical readers to what is surely the most important open problem in computer science. ---Leslie Ann Goldberg, LMS Newsletter, "Accessible and easy to digest. . . . The Golden Ticket is a great introduction to a maths problem that few people know about and even fewer understand and a great way to try to start thinking about it and its implications." ---Johar M. Ashfaque, Mathematics Today, The Golden Ticket does a good job of explaining a complex concept in terms that a secondary-school student will understand--a hard problem in its own right, even if not quite NP., Fortnow's book does a fine job of showing why the tantalizing question is an important one, with implications far beyond just computer science. ---Rob Hardy, Commercial Dispatch, [ The Golden Ticket ] is a book on a technical subject aimed at a general audience. . . . Lance's mix of technical accuracy with evocative story telling works. ---Michael Trick, Michael Trick's Operations Research Blog, Fortnow effectively initiates readers into the seductive mystery and importance of P and NP problems., "Fortnow's book provides much of the background and personal information on the main characters involved in this problem--notably Steven Cook, with a cameo appearance by Kurt Gdel--that one does not get in the more technical treatments. There is a lot of information in this book, and the serious computer science student is sure to learn from it." --James M. Cargal, UMAP Journal, Fortnow's book is just the ticket for bringing one of the major theoretical problems of our time to the level of the average citizen--and yes, that includes elected officials. ---Veit Elser, Science, The Golden Ticket is an extremely accessible and enjoyable treatment of the most important question of theoretical computer science, namely whether P is equal to NP., Without bringing formulas or computer code into the narrative, Fortnow sketches the history of this class of questions, convincingly demonstrates their surprising equivalence, and reveals some of the most far-reaching implications that a proof of P = NP would bring about. These might include tremendous advances in biotechnology (for instance, more cures for cancer), information technology, and even the arts. Verdict: Through story and analogy, this relatively slim volume manages to provide a thorough, accessible explanation of a deep mathematical question and its myriad consequences. An engaging, informative read for a broad audience. ---J.J.S. Boyce, Library Journal, This is a fabulous book for both educators and students at the secondary school level and above. It does not require any particular mathematical knowledge but, rather, the ability to think. Enjoy the world of abstract ideas as you experience an intriguing journey through mathematical thinking. ---Gail Kaplan, Mathematics Teacher, The book is accessible and useful for practically anyone from smart high school students to specialists. . . . [P]erhaps the interest sparked by this book will be the 'Golden Ticket' for further accessible work in this area. And perhaps P=NP will start to become as famous as E=mc2. ---Michael Trick, INFORMS Journal of Computing, Thoroughly researched and reviewed. Anyone from a smart high school student to a computer scientist is sure to get a lot of this book. The presentation is beautiful. There are few formulas but lots of facts., As Fortnow describes. . . P versus NP is 'one of the great open problems in all of mathematics' not only because it is extremely difficult to solve but because it has such obvious practical applications. It is the dream of total ease, of the confidence that there is an efficient way to calculate nearly everything, 'from cures to deadly diseases to the nature of the universe,' even 'an algorithmic process to recognize greatness.'. . . To postulate that P ≠NP, as Fortnow does, is to allow for a world of mystery, difficulty, and frustration--but also of discovery and inquiry, of pleasures pleasingly delayed. ---Alexander Nazaryan, New Yorker
Copyright Date
2013
Target Audience
Trade
Topic
History & Philosophy, Programming / Algorithms, Linear & Nonlinear Programming
Dewey Decimal
511.352
Dewey Edition
23
Genre
Computers, Mathematics
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
Rarewaves-USA
10100 W Sample Rd
33065 Coral Springs, FL
United States
Je certifie que toutes mes activités de vente seront conformes à toutes les lois et réglementations de l'UE.
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :335195204278
Dernière mise à jour le 03 mai 2024 19:19:39 CEST. Afficher toutes les modificationsAfficher toutes les modifications
Livraison et expédition
L'objet ne peut pas être envoyé vers : États-Unis
Lieu où se trouve l'objet :
60502, États-Unis
Destination :
Afrique du Sud, Albanie, Algérie, Andorre, Angola, Anguilla, Antigua-et-Barbuda, Antilles néerlandaises, Arabie saoudite, Argentine, Arménie, Aruba, Azerbaïdjan, Bahamas, Bahreïn, Bangladesh, Belgique, Belize, Bermudes, Bolivie, Bosnie-Herzégovine, Botswana, Bulgarie, Burkina Faso, Burundi, Bénin, Cambodge, Cameroun, Cap-Vert, Chili, Chine, Chypre, Colombie, Comores, Corée du Sud, Costa Rica, Croatie, Côte d'Ivoire, Danemark, Djibouti, Dominique, Estonie, Fidji, Finlande, Gabon, Gambie, Ghana, Gibraltar, Grenade, Groenland, Grèce, Guam, Guatemala, Guernesey, Guinée, Guinée équatoriale, Guinée-Bissau, Guyana, Géorgie, Haïti, Honduras, Hong Kong, Hongrie, Inde, Indonésie, Irak, Islande, Jamaïque, Japon, Jersey, Jordanie, Kazakhstan, Kenya, Kirghizistan, Kiribati, Koweït, Lesotho, Lettonie, Liban, Liberia, Liechtenstein, Lituanie, Luxembourg, Macao, Macédoine, Madagascar, Malaisie, Malawi, Maldives, Mali, Malte, Maroc, Maurice, Mauritanie, Mayotte, Micronésie, Moldavie, Monaco, Monde entier, Mongolie, Montserrat, Monténégro, Mozambique, Namibie, Nauru, Nicaragua, Niger, Nigeria, Niue, Norvège, Nouvelle-Zélande, Népal, Oman, Ouganda, Ouzbékistan, Pakistan, Palaos, Panama, Papouasie-Nouvelle-Guinée, Paraguay, Philippines, Pologne, Porto Rico, Portugal, Pérou, Qatar, Roumanie, Rwanda, République centrafricaine, République dominicaine, République du Congo, République démocratique du Congo, République tchèque, Sahara occidental, Saint-Christophe-et-Niévès, Saint-Marin, Saint-Pierre-et-Miquelon, Saint-Vincent-et-les-Grenadines, Sainte-Hélène, Sainte-Lucie, Salvador, Samoa américaines, Samoa occidentales, Serbie, Seychelles, Sierra Leone, Singapour, Slovaque, Slovénie, Somalie, Sri Lanka, Suriname, Suède, Svalbard et Jan Mayen, Swaziland, Sénégal, Tadjikistan, Tanzanie, Taïwan, Tchad, Thaïlande, Togo, Tonga, Trinité-et-Tobago, Tunisie, Turkménistan, Turquie, Tuvalu, Uruguay, Vanuatu, Vatican, Viêt Nam, Wallis-et-Futuna, Zambie, Zimbabwe, Égypte, Émirats arabes unis, Équateur, Érythrée, Éthiopie, Îles Caïmans, Îles Cook, Îles Malouines, Îles Marshall, Îles Salomon, Îles Turques-et-Caïques, Îles Vierges britanniques, Îles Vierges des États-Unis
Exclus :
Afghanistan, Allemagne, Australie, Autriche, Barbade, Bhoutan, Biélorussie, Brunei Darussalam, Brésil, Espagne, France, Guadeloupe, Guyane, Irlande, Israël, Italie, Laos, Libye, Martinique, Mexique, Nouvelle-Calédonie, Pays-Bas, Polynésie française, Royaume-Uni, Russie, Réunion, Suisse, Ukraine, Venezuela, Yémen, États-Unis
Délai d'expédition |
---|
Envoi sous 7 jours ouvrés après réception du paiement. |
Taxes |
---|
Des taxes pourront être appliquées lors de la finalisation de l'achat. En savoir plusEn savoir plus sur le paiement des taxes sur les achats eBay |
Taxe de vente pour l'objet n°335195204278
Taxe de vente pour l'objet n°335195204278
Le vendeur facture une taxe de vente pour les États suivants :
État | Taux de la taxe de vente |
---|
Conditions de retour
Une fois l'objet reçu, contactez le vendeur dans un délai de | Frais de retour |
---|---|
30 jours | L'acheteur paie les frais de retour |
L'acheteur doit payer les frais de retour.
Détails des conditions de retour |
---|
Retours acceptés |
Détails du paiement
Modes de paiement
Inscrit comme vendeur professionnel
Évaluations en tant que vendeur (62.765)
l***m (124)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
I got a nice copy of the item and received it on time.
s***s (1349)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Fast shipping!!
s***s (1349)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Great item, Great Seller!!