Algorithmic Barriers Falling: P=np? - Couverture souple

Knuth, Donald E; Daylight, Edgar G

 
9789491386046: Algorithmic Barriers Falling: P=np?
Couverture souple
ISBN 10 : 9491386042 ISBN 13 : 9789491386046
Editeur : Lonely Scholar, 2014

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Lonely Scholar
Date d'édition
2014
Langue
anglais
ISBN 10 
9491386042
ISBN 13 
9789491386046
Reliure
Broché
Nombre de pages
122
Éditeur
De Grave Kurt
Coordonnées du fabricant
non disponible
Personne responsable
gpsr@libri.de
gpsr@libri.de

Friedensallee 273
Hamburg
22763
Allemagne