click to view more
Algorithmic Barriers Falling: P=np?
by Algorithmic Barriers Falling: P=np?
$17.10
List Price: $19.99
Save: $2.89 (14%)
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:
- 9491386042 ISBN-10:
- 9789491386046 ISBN-13:
- English Language
- 9 in * 0.26 in * 6 in Dimensions:
- 2 lb Weight:
Money Back
Love it! Use it! Reuse it!
Free Shipping
Shipping is on us
Free Support
24/24 available
