Algorithmic Barriers Falling

Name: Algorithmic Barriers Falling
SKU: 23748632
Price: 55.99 AUD
Availability: InStock

P=np?

By:

Format:

Paperback / softback

Show Hide Adult Content

$55.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

Afterpay is available on orders $100 to $2000 Learn more

Availability

Delivering to:

Estimated arrival:

Around 7-19 June using International Courier

Description

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

Release date Australia

November 12th, 2014

Author

Audience

General (US: Trade)

Contributor

Edited by Kurt De Grave

Pages

122

Dimensions

152x229x7

ISBN-13

9789491386046

Product ID

23748632

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here