OurBigBook
About
$
Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
P versus NP problem (P vs NP)
Interesting because of the
Cook-Levin theorem
: if only a single
NP-complete
problem were in
P
, then all NP-complete problems would also be P!
We all know the answer for this: either false or
independent
.
Table of contents
Ladner's Theorem
Ladner's Theorem
P versus NP problem
Ancestors
NP-complete
NP
EXPTIME
ELEMENTARY
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Index
Incoming links
BQP
Computer science
Millennium Prize Problems
Synonyms
cirosantilli/p-vs-np
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source