Skip to main content
PBS logo
 
 

Search - Algorithmic Barriers Falling: P=NP?

Algorithmic Barriers Falling: P=NP?
Algorithmic Barriers Falling PNP
Author: Donald E. Knuth, Edgar G. Daylight
"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. Kn...  more »
ISBN-13: 9789491386046
ISBN-10: 9491386042
Publication Date: 11/12/2014
Pages: 122
Rating:
  ?

0 stars, based on 0 rating
Publisher: Lonely Scholar
Book Type: Paperback
Members Wishing: 0
Reviews: Amazon | Write a Review


Genres: