The golden ticket: P, NP, and the search for the impossible - Fortnow, Lance (Princeton University Press, 2013)
Keywords: 1KBB; A Brief History of Time; Adviser; Age of the universe; Alan Turing; Algorithm; Algorithms; American; Approximation; Berkeley; Byte; Calculation; Campaign manager; Clay Mathematics Institute; Clique problem; Computation; Computational complexity theory; Computational problem; Computer; Computer algorithms; Computer program; Computer science; Computer scientist; COMPUTERS; COMPUTERS / Programming / Algorithms; COMPUTERS / Programming / Algorithms. bisacsh; Computing; Cryptanalysis; Cryptography; David Eppstein; DCF; Diagram; Email; Entscheidungsproblem; Frenemy; Gil Kalai; Grigori Perelman; Heuristic; History & Philosophy; Jack Edmonds; Juris Hartmanis; Lance Fortnow; Leonid Levin; Machine learning; Massachusetts Institute of Technology; Mathematician; MATHEMATICS; MATHEMATICS / History & Philosophy; MATHEMATICS / History & Philosophy. bisacsh; MATHEMATICS / Linear Programming. bisacsh; MATHEMATICS / Mathematical Analysis; MATHEMATICS / Mathematical Analysis. bisacsh; MATHEMATICS / Optimization; MATHEMATICS / Linear & Nonlinear Programming; Michael Sipser; Millennium Prize Problems; Moore's law; NP-complete problems; NP-completeness; Occam's razor; Open problem; P versus NP problem; Paperback; Parallel computing; Physicist; Poetry; Prediction; Princeton University Press; Printing; Proceedings; Programming; Public-key cryptography; Quantum computing; Quantum cryptography; Quantum mechanics; Qubit; Random House; Robert R. McCormick School of Engineering and Applied Science; Scientist; Smart card; Stanley Milgram; Stephen Hawking; Technology; Theoretical computer science; Time complexity; Toyota Technological Institute at Chicago; Transistor; Travelling salesman problem; Treatise; University of California; Website; Email; Gil Kalai; Smart card; Berkeley; University of California; Treatise; Proceedings; Quantum computing; Computer program