Algorithmic Barriers Falling: P=np?


LOOKING TO PLACE A BULK ORDER?CLICK HERE

Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Fast Delivery
Fast Delivery
Sustainably Printed
Sustainably Printed
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.

About The Book

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 Patersons $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 Knuths pioneering work in the Analysis of Algorithms? By investigating Knuths developing thoughts on the theoretical underpinnings of efficient computation this book sheds light on Knuths present-day conjecture that P = NP.
downArrow

Details