Golden Ticket (eBook)

P, NP, and the Search for the Impossible

Lance Fortnow (Autor)

eBook Download: PDF | EPUB

2013
192 Seiten
Princeton University Press (Verlag)
978-1-4008-4661-0 (ISBN)

Infos

Lance Fortnow is professor and chair of the School of Computer Science at Georgia Institute of Technology and the founder and coauthor of the Computational Complexity blog.

---

The computer science problem whose solution could transform life as we know itThe P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

Produkt-Details

• Erscheint lt. Verlag: 27.3.2013
• Zusatzinfo: 41 halftones. 41 line illus.
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Sachbuch/Ratgeber ► Natur / Technik
• Themenwelt: Informatik ► Netzwerke ► Sicherheit / Firewall
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Analysis
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Geschichte der Mathematik
• Schlagworte: A Brief History of Time • Academic work • Adviser • age of the universe • Alan Turing • Algebraic Geometry • algorithm • algorithms • Andrew Wiles • Approximation • Big Data • Byte • Calculation • campaign manager • casserole • Cathy • Clay Mathematics Institute • Clique problem • Cogito ergo sum • Computation • computational complexity theory • Computational problem • computational problems • Computer • Computer Program • Computers • Computer Science • Computer Scientist • computing • Cryptanalysis • cryptography • cryptosystem • Database • David Eppstein • decryption • diagram • Digital Computers • Efficient Algorithms • efficient computation • Email • Encryption • Entscheidungsproblem • Facebook • Factoring • fast computers • Finding • Frenemy • Gil Kalai • googol • Gordon Moore • graph isomorphism • greatness • Grigori Perelman • Hamiltonian path • hamiltonian paths • Hardness • Heuristic • Heuristics • Icosian Game • Intel • Internet • Jack Edmonds • Juris Hartmanis • Kenneth Appel • Ketan Mulmuley • Lance Fortnow • Laptop • Leonid Levin • Linear Programming • machine learning • Martin Hellman • Massachusetts Institute of Technology • mathematician • Mathematics • max-cut • Michael Sipser • Milgram • Millennium Prize problems • Moore's law • Moshe Vardi • Networking • Network Security • New Technologies • np-complete • np-completeness • NP-complete problems • NP problem • NP problems • Occam's Razor • One-time Pad • Open problem • Paperback • Parallel Computation • Parallel Computing • perebor • physicist • Prediction • Prime Numbers • Princeton University Press • printing • Probability • Problems • Proceedings • programming • Public-Key Cryptography • P versus NP • P versus NP problem • Quantum Computers • Quantum Computing • Quantum Cryptography • quantum mechanics • quantum physical systems • Qubit • Random House • research community • result • Richard Feynman • Roald Dahl • Robert R. McCormick School of Engineering and Applied Science • Scientist • Search problem • secret messages • Smart card • social networking data • Solution • Standing Ovation • Stanley Milgram • Steganography • Stephen Hawking • Steve • Steve Cook • Supercomputer • Technology • Teleportation • theoretical computer science • time complexity • Toyota Technological Institute at Chicago • Transistor • travelling salesman problem • treatise • Twitter • University of California, Berkeley • Urbana algorithm • Vulnerability (computing) • Website • Whitfield Diffie • Wi-Fi
• ISBN-10: 1-4008-4661-7 / 1400846617
• ISBN-13: 978-1-4008-4661-0 / 9781400846610