A Brief History of Time
A01=Lance Fortnow
Adviser
Age Group_Uncategorized
Age Group_Uncategorized
Age of the universe
Alan Turing
Algorithm
Approximation
Author_Lance Fortnow
automatic-update
Berkeley
Byte
Calculation
Campaign manager
Category1=Non-Fiction
Category=PBK
Category=PBU
Category=PBX
Category=PDZ
Clay Mathematics Institute
Clique problem
Computation
Computational complexity theory
Computational problem
Computer
Computer program
Computer science
Computer scientist
Computing
COP=United States
Cryptanalysis
Cryptography
David Eppstein
Delivery_Delivery within 10-20 working days
Diagram
Email
Entscheidungsproblem
eq_isMigrated=2
eq_non-fiction
eq_science
Frenemy
Gil Kalai
Grigori Perelman
Heuristic
Jack Edmonds
Juris Hartmanis
Lance Fortnow
Language_English
Leonid Levin
Machine learning
Massachusetts Institute of Technology
Mathematician
Michael Sipser
Millennium Prize Problems
Moore's law
NP-completeness
Occam's razor
Open problem
P versus NP problem
PA=Available
Paperback
Parallel computing
Physicist
Prediction
Price_€20 to €50
Princeton University Press
Printing
Proceedings
PS=Active
Public-key cryptography
Quantum computing
Quantum cryptography
Quantum mechanics
Qubit
Random House
Robert R. McCormick School of Engineering and Applied Science
Scientist
Smart card
softlaunch
Stanley Milgram
Stephen Hawking
Technology
Theoretical computer science
Time complexity
Toyota Technological Institute at Chicago
Transistor
Travelling salesman problem
Treatise
University of California
Website
Product details
- ISBN 9780691175782
- Weight: 312g
- Dimensions: 152 x 235mm
- Publication Date: 28 Feb 2017
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
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.
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.
Qty: