✳flâneur — a map of the web's best reading

P versus NP problem

en.wikipedia.org · 9,040 words · saved by 1 readers

The P versus NP problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified can also be quickly solved.

P versus NP problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Unsolved problem in computer science Unsolved problem in computer science If the solution to a problem can be checked in polynomial time, must the problem be solvable in polynomial time? More unsolved problems in computer science Millennium Prize Problems Birch and Swinnerton-Dyer conjecture Hodge conjecture Navier–Stokes existence and smoothness P versus NP problem Poincaré conjecture (solved) Riemann hypothesis Yang–Mills existence and mass gap v t e The P versus NP problem is a major unsolved problem in th

Explore this link on the map →

saved by

related reading