Skip to main content alibris logo
Algorithmic Barriers Falling: P=np? - Knuth, Donald E, and Daylight, Edgar G, and De Grave, Kurt (Editor)
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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

loading
Algorithmic Barriers Falling: P=np? 2014, Lonely Scholar

ISBN-13: 9789491386046

Trade paperback