Narrow your search

Library

KU Leuven (1)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

UHasselt (1)

VIVES (1)

VUB (1)


Resource type

book (1)


Language

English (1)


Year
From To Submit

2013 (1)

Listing 1 - 1 of 1
Sort by

Book
The golden ticket : P, NP, and the search for the impossible
Author:
ISBN: 9780691156491 0691156492 1400846617 9781400846610 1299156568 9781299156562 Year: 2013 Publisher: Princeton Princeton University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

"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 solved by computer. This book provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this book, the author traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem 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. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. This book explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem."--Jacket.

Keywords

Computer science --- NP-complete problems. --- Computer algorithms. --- Problems, NP-complete --- Computational complexity --- Algorithms --- NP-complete problems --- Computer algorithms --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- MATHEMATICS / Mathematical Analysis. --- MATHEMATICS / Linear Programming. --- MATHEMATICS / History & Philosophy. --- 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.

Listing 1 - 1 of 1
Sort by