The Golden Ticket : P, NP, and the Search for the Impossible /

Mostrar otras versiones (3)

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, i...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Fortnow, Lance (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Princeton, NJ : Princeton University Press, [2013]
Edición:Course Book
Temas:
Computer algorithms.
NP-complete problems.
COMPUTERS / Programming / Algorithms.
Facebook.
Frenemy.
Hamiltonian paths.
Internet.
Ketan Mulmuley.
Leonid Levin.
Martin Hellman.
NP problem.
NP problems.
NP-complete.
P versus NP problem.
P versus NP.
Richard Feynman.
Steve Cook.
Twitter.
Urbana algorithm.
Whitfield Diffie.
academic work.
algebraic geometry.
algorithm.
algorithms.
approximation.
big data.
computational problems.
computer science.
computers.
computing.
cryptography.
cryptosystem.
database.
decryption.
digital computers.
efficient algorithms.
efficient computation.
encryption.
factoring.
fast computers.
graph isomorphism.
heuristics.
linear programming.
mathematics.
max-cut.
network security.
networking.
new technologies.
parallel computation.
perebor.
prime numbers.
problems.
programming.
public-key cryptography.
quantum computers.
quantum computing.
quantum cryptography.
quantum mechanics.
quantum physical systems.
research community.
secret messages.
social networking data.
solution.
teleportation.
Acceso en línea:Texto completo
Texto completo
Descripción
Sumario: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.
Descripción Física:1 online resource (192 p.) : 41 halftones. 41 line illus.
ISBN:9781400846610
9783110442502
Acceso:restricted access

Ejemplares similares