Leseprobe
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
The Golden Ticket
Lance Fortnow
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Informatik, EDV
Beschreibung
The computer science problem whose solution could transform life as we know it
The 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.
Kundenbewertungen
Stanley Milgram, Toyota Technological Institute at Chicago, Clique problem, Moore's law, Computer, Entscheidungsproblem, Approximation, NP-completeness, Paperback, Parallel computing, Printing, Qubit, Massachusetts Institute of Technology, A Brief History of Time, Leonid Levin, Robert R. McCormick School of Engineering and Applied Science, Quantum cryptography, Occam's razor, Quantum computing, Algorithm, Random House, Juris Hartmanis, Travelling salesman problem, Computing, Lance Fortnow, Machine learning, Age of the universe, Computer science, Computational problem, Grigori Perelman, Open problem, Adviser, Computer scientist, Mathematician, Alan Turing, Computer program, Time complexity, Prediction, Calculation, Scientist, Theoretical computer science, Millennium Prize Problems, Website, Campaign manager, Technology, Cryptography, Michael Sipser, Computation, Physicist, University of California, Berkeley, Stephen Hawking, Transistor, P versus NP problem, Diagram, Email, Frenemy, Proceedings, Jack Edmonds, David Eppstein, Clay Mathematics Institute, Computational complexity theory, Treatise, Heuristic, Princeton University Press, Byte, Gil Kalai, Quantum mechanics, Cryptanalysis, Public-key cryptography, Smart card