Algorithmic Barriers Falling

Algorithmic Barriers Falling P=np?

Paperback (12 Nov 2014)

  • $21.10
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's 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.

Book information

ISBN: 9789491386046
Publisher: Lonely Scholar
Imprint: Lonely Scholar
Pub date:
DEWEY: 519.7
Language: English
Number of pages: 122
Weight: 194g
Height: 231mm
Width: 154mm
Spine width: 12mm