Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Algorithmic Barriers Falling: P=np?

by Donald E. Knuth , Edgar G. Daylight , Kurt De Grave
Save 11% Save 11%
Current price ₹1,683.00
Original price ₹1,897.00
Original price ₹1,897.00
Original price ₹1,897.00
(-11%)
₹1,683.00
Current price ₹1,683.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9789491386046
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Lonely Scholar
  • Publisher Imprint: Lonely Scholar
  • Publication Date:
  • Pages: 122
  • Original Price: GBP 14.99
  • Language: English
  • Edition: N/A
  • Item Weight: 173 grams
  • BISAC Subject(s): Computer Science

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

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us