OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
NP-hard
A problem such that all NP problems can be reduced in polynomial time to it.
Ancestors
NP
EXPTIME
ELEMENTARY
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Index
Incoming links
NP-complete
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source