Algorithmic Barriers Falling: P=np?
Product Description
Algorithmic Barriers Falling: P=np?
"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.
Technical Specifications
You might also like
The Essential Knuth
Pluralism in Software Engineering: Turing Award Winner Peter Naur Explains
The Dawn of Software Engineering: from Turing to Dijkstra
The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability
Selected Papers on Fun and Games (Lecture Notes)
The MMIX Supplement: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth
Algorithms to Live By: The Computer Science of Human Decisions
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings and Lecture Notes)
The Golden Ticket: P, NP, and the Search for the Impossible
Great Principles of Computing (MIT Press)