Strict Standards: Redefining already defined constructor for class XML_Parser in /home/sites/www.americanpoems.com/web/store/aom/includes/os.php on line 1188

Strict Standards: Declaration of XML_Parser::raiseError() should be compatible with PEAR::raiseError($message = NULL, $code = NULL, $mode = NULL, $options = NULL, $userinfo = NULL, $error_class = NULL, $skipmsg = false) in /home/sites/www.americanpoems.com/web/store/aom/includes/os.php on line 1604

Strict Standards: Declaration of XML_Unserializer::startHandler() should be compatible with XML_Parser::startHandler($xp, $elem, &$attribs) in /home/sites/www.americanpoems.com/web/store/aom/includes/os.php on line 3503

Strict Standards: Declaration of Cache_Lite_File::get() should be compatible with Cache_Lite::get($id, $group = 'default', $doNotTestCacheValidity = false) in /home/sites/www.americanpoems.com/web/store/aom/includes/cache.php on line 1020
American Poems: Books: The Golden Ticket: P, NP, and the Search for the Impossible
Home
Apparel
Appliances
Books
DVD
Electronics
Home & Garden
Kindle eBooks
Magazines
Music
Outdoor Living
Software
Tools & Hardware
PC & Video Games
Location:
 Home » Books » The Golden Ticket: P, NP, and the Search for the Impossible

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

  • List Price: $26.95
  • Buy New: $16.26
  • as of 7/14/2014 12:21 EDT details
  • You Save: $10.69 (40%)
In Stock
New (54) Used (33) from $11.02
  • Seller:Abundance Booksellers
  • Sales Rank:381,320
  • Languages:English (Unknown), English (Original Language), English (Published)
  • Media:Hardcover
  • Number Of Items:1
  • Pages:192
  • Shipping Weight (lbs):1
  • Dimensions (in):9.5 x 6.4 x 0.8
  • Publication Date:March 31, 2013
  • ISBN:0691156492
  • EAN:9780691156491
  • ASIN:0691156492
Availability:Usually ships in 1-2 business days


Editorial Reviews:
Synopsis

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.


CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.
Brought to you by American Poems