Picture 1 of 1

Stock photo

Donald E Knuth Edgar G Daylight Algorithmic Barriers Falling (Paperback) - Picture 1 of 1

Algorithmic Barriers Falling: P=np? by Donald E Knuth, Edgar G Daylight (Paperback, 2014)

Rarewaves Outlet (1368046)

98.1% positive feedback

Price:

GBP 17.94

ApproximatelyPHP 1,323.76

+ 2.99 shipping

Estimated delivery Wed, 21 May - Sat, 24 May

Returns:

30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

About this product

Product Information

A prize of $10 from Blum, $10 from Meyer, GBP4 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.