|
![]() |
|||
|
||||
Overview"""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." Full Product DetailsAuthor: Donald E Knuth (Stanford University California) , Edgar G Daylight , Kurt De GravePublisher: Lonely Scholar Imprint: Lonely Scholar Dimensions: Width: 15.20cm , Height: 0.70cm , Length: 22.90cm Weight: 0.172kg ISBN: 9789491386046ISBN 10: 9491386042 Pages: 122 Publication Date: 12 November 2014 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |