Ciro Santilli
OurBigBook.com
$£
Sponsor
中国
独裁统治 China Dictatorship 新疆改造中心、六四事件、法轮功、郝海东、709大抓捕、2015巴拿马文件 邓家贵、低端人口、西藏骚乱
P versus NP problem
(P vs NP)
...
Computational problem
Complexity class
ELEMENTARY (complexity)
EXPTIME
NP (complexity)
NP-complete
OurBigBook.com
Words: 32
Articles: 1
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
32
1
Ladner's Theorem
P versus NP problem
Ancestors
(12)
NP-complete
NP (complexity)
EXPTIME
ELEMENTARY (complexity)
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Home
Incoming links
(3)
BQP
Computer science
Millennium Prize Problems
Synonyms
(1)
P vs NP