Picture 1 of 5
Gallery
Picture 1 of 5
Have one to sell?
Golden Ticket: P, NP, and the Search for the Impossible by Lance Fortnow 2017 VG
US $12.88
ApproximatelyS$ 16.77
or Best Offer
Condition:
“Light shelf wear.”
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: Weaverville, North Carolina, United States
Delivery:
Estimated between Mon, 17 Nov and Thu, 20 Nov to 94104
Returns:
30 days return. Seller pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:205144229971
Item specifics
- Condition
- Very Good
- Seller Notes
- “Light shelf wear.”
- Country of Origin
- United States
- ISBN
- 9780691175782
About this product
Product Identifiers
Publisher
Princeton University Press
ISBN-10
0691175780
ISBN-13
9780691175782
eBay Product ID (ePID)
228894361
Product Key Features
Number of Pages
192 Pages
Publication Name
Golden Ticket : P, Np, and the Search for the Impossible
Language
English
Subject
Programming / Algorithms, History & Philosophy, Linear & Nonlinear Programming
Publication Year
2017
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
0.8 in
Item Weight
11 Oz
Item Length
9.2 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Trade
TitleLeading
The
Dewey Edition
23
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 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, "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, 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, 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., 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
Dewey Decimal
511.352
Synopsis
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., 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, The computer science problem whose solution could transform life as we know it 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.
LC Classification Number
QA
Item description from the seller
Popular categories from this store
Seller feedback (440)
- a***o (2646)- Feedback left by buyer.Past 6 monthsVerified purchaseExcellent, packaged really well book is in excellent condition and as described. Really quick shipping seeing as it came from a long way. Excellent value. So pleased and would absolutely recommend this seller. Many thanks to you and kind regards.
- i***w (333)- Feedback left by buyer.Past yearVerified purchaseHighly recommend this Seller. The 13 books are over 100 years old and are in great shape. The Seller was super to work with on price and on communication. Quick responses to my questions. The books arrived perfectly packaged, a day early and even better than described. I look forward to future orders with this Seller!The Home Library 13 Book Set Alexandre Dumas A.L. Burt Company c1905 HC VG (#205244998173)
- r***1 (287)- Feedback left by buyer.Past monthVerified purchasewell packed, fast delivery, great condition as described, A++ ebayer
Popular categories from this store
Seller feedback (440)
- a***o (2646)- Feedback left by buyer.Past 6 monthsVerified purchaseExcellent, packaged really well book is in excellent condition and as described. Really quick shipping seeing as it came from a long way. Excellent value. So pleased and would absolutely recommend this seller. Many thanks to you and kind regards.
- i***w (333)- Feedback left by buyer.Past yearVerified purchaseHighly recommend this Seller. The 13 books are over 100 years old and are in great shape. The Seller was super to work with on price and on communication. Quick responses to my questions. The books arrived perfectly packaged, a day early and even better than described. I look forward to future orders with this Seller!The Home Library 13 Book Set Alexandre Dumas A.L. Burt Company c1905 HC VG (#205244998173)
- r***1 (287)- Feedback left by buyer.Past monthVerified purchasewell packed, fast delivery, great condition as described, A++ ebayer