...
click to view more

Algorithmic Barriers Falling: P=np?

by Algorithmic Barriers Falling: P=np?

$23.34

add to favourite
  • In Stock - Guaranteed to ship in 24 hours with Free Online tracking.
  • FREE DELIVERY by Monday, April 21, 2025 9:27:06 PM UTC
  • 24/24 Online
  • Yes High Speed
  • Yes Protection
Tell-A-Friend
Last update:

Description

"A prize of $10 from Blum, $10 from Meyer, £4 from Paterson and 30-DM from Schnorr is offered to anyone who first solves the Cook-Karp problem whether P = NP. Blum bet $100 that P != NP against Paterson's $1 that P = NP." -- SIGACT News, January 1973, page 3 These playful bets capture youthful optimism in Complexity Theory. Did Donald E. Knuth share this optimism at the time? And how did the findings of complexity theorists interlace with Knuth's pioneering work in the Analysis of Algorithms? By investigating Knuth's developing thoughts on the theoretical underpinnings of efficient computation, this book sheds light on Knuth's present-day conjecture that P = NP.

Last updated on

Product Details

  • Lonely Scholar Brand
  • Nov 12, 2014 Pub Date:
  • 9789491386046 ISBN-13:
  • 9491386042 ISBN-10:
  • English Language
  • 9 in * 0.26 in * 6 in Dimensions:
  • 2 lb Weight: