secretGeek.netHow important is the problem of whether or not P=NP?
'The question of whether P=NP has been occupying researchers since these two sets were first defined, having become the greatest unsolved problem in computer science...'
from Alan Turing: Life and Legacy of a Great Thinker
How important is the problem of whether or not P=NP?
'Does P = NP? This is undoubtedly the most profound question in computer science...'
from: Tutorial: Does P = NP?
How important is the problem of whether or not P=NP?
'The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field...'
from Wikipedia Article on 'P=NP' problem
How important is the problem of whether or not P=NP?
[If you can show that P=NP, then] 'most cryptographic algorithms are basically useless'
from comment by Charles on November 15, 2008 06:13 PM
How important is the problem of whether or not P=NP?
'The Clay Mathematics Institute has offered a $1 million US prize for the first correct proof.'
from Wikipedia Article on 'P=NP' problem
OMFG! They offered what!?
'The Clay Mathematics Institute has offered a $1 million US prize for the first correct proof.'
from Wikipedia Article on 'P=NP' problem
I thought that was what you said.
One MILLION dollars!
Problems sure can't get any more profound than that!
My book "Choose Your First Product" is available now.
It gives you 4 easy steps to find and validate a humble product idea.