Algorithmic Barriers Falling: P=np?

Knuth, Donald E; Daylight, Edgar G; De Grave, Kurt

ISBN 10: 9491386042 / ISBN 13: 9789491386046

Published by Lonely Scholar (edition ), 2014

About this Item

It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Seller Inventory # 9491386042-8-1

Bibliographic Details

• Title: Algorithmic Barriers Falling: P=np?
• Publisher: Lonely Scholar (edition )
• Publication Date: 2014
• Language: English
• ISBN 10: 9491386042
• ISBN 13: 9789491386046
• Binding: Paperback
• Condition: Very Good

About this title

Synopsis

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