**One of Amazon.com’s 2013 Best Science Books**

**One of Choice's Outstanding Academic Titles for 2013**

"As Lance Fortnow describes in his new book,

"Fortnow effectively initiates readers into the seductive mystery and importance of P and NP problems."

"Fortnow's book is just the ticket for bringing one of the major theoretical problems of our time to the level of the average citizen--and yes, that includes elected officials."

"Without bringing formulas or computer code into the narrative, Fortnow sketches the history of this class of questions, convincingly demonstrates their surprising equivalence, and reveals some of the most far-reaching implications that a proof of P = NP would bring about. These might include tremendous advances in biotechnology (for instance, more cures for cancer), information technology, and even the arts. Verdict: Through story and analogy, this relatively slim volume manages to provide a thorough, accessible explanation of a deep mathematical question and its myriad consequences. An engaging, informative read for a broad audience."

"[This] as-yet-unsolved problem--identified by mathematicians as the P-NP problem--raises fundamental questions about just how far society can ride the technological wave triggered by the computer revolution. Fortnow unfolds a fascinating dual-track story of how this problem first emerged, Western researchers encountering it while trying to maximize computer efficiency, Russian analysts confronting it while puzzling over the persistent need for perebor ('brute force search'). Readers watch as the P-NP problem attracts investigators in cryptography, biology, quantum physics, and social networking--and frustrates them all. Fortnow allows nonspecialist readers to glimpse the conceptual difficulties here (try 'nondeterministic polynomial time,' for example). But he mercifully frames his discussion largely in nontechnical terms. Even readers averse to mathematics will share in the intellectual stimulation of pondering a riddle compelling us to ask what we should hope for--and fear--in replacing human brains with computer algorithms. A provocative reminder of the real-world consequences of a theoretical enigma."

"The definition of this problem is tricky and technical, but in

"Fortnow's book does a fine job of showing why the tantalizing question is an important one, with implications far beyond just computer science."

"A great book. . . . [Lance Fortnow] has written precisely the book about P vs. NP that the interested layperson or IT professional wants and needs."

"[

"Thoroughly researched and reviewed. Anyone from a smart high school student to a computer scientist is sure to get a lot of this book. The presentation is beautiful. There are few formulas but lots of facts."

"An entertaining discussion of the P versus NP problem."

"

"The book is accessible and useful for practically anyone from smart high school students to specialists. . . . [P]erhaps the interest sparked by this book will be the 'Golden Ticket' for further accessible work in this area. And perhaps P=NP will start to become as famous as E=mc2."

"In any case, it is excellent to have a nontechnical book about the P versus NP question.

"

"The whole book is fun to read and can be fully appreciated without any knowledge in (theoretical) computer science. Fortnow's efforts to make the difficult material accessible to non-experts should be commended. . . . The book thus caters to all audiences: from novices with an interest in computational problems to experts with knowledge in theoretical computer science."

"This is a fabulous book for both educators and students at the secondary school level and above. It does not require any particular mathematical knowledge but, rather, the ability to think. Enjoy the world of abstract ideas as you experience an intriguing journey through mathematical thinking."

The P-NP problem is the most important open problem in computer science, if not all of mathematics. *The Golden Ticket* provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.

*The Golden Ticket* explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem.

*„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.*

EUR 27,73

**Versand:**
EUR 29,50

Von Deutschland nach USA

Verlag:
Princeton Univers. Press Mai 2013
(2013)

ISBN 10: 0691156492
ISBN 13: 9780691156491

Neu
Anzahl: 1

Anbieter

Bewertung

**Buchbeschreibung **Princeton Univers. Press Mai 2013, 2013. Buch. Buchzustand: Neu. 241x159x25 mm. Neuware - Describes the benefits and unexpected challenges of the P-NP problem in mathematics. 176 pp. Englisch. Artikel-Nr. 9780691156491

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter