Algorithmic Barriers Falling: P=np?

"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.

Author: Donald E. Knuth, Edgar G. Daylight
Publisher: Lonely Scholar
Published: 11/12/2014
Pages: 122
Binding Type: Paperback
Weight: 0.38lbs
Size: 9.00h x 6.00w x 0.26d
ISBN13: 9789491386046
ISBN10: 9491386042
BISAC Categories:
- Computers | Computer Science
- Computers | History
- Computers | Programming | General

This title is not returnable