«
[ Back to Home ] » << Return to Computer Dictionary Home
.
Computer Dictionary Online
A to Z Computer Terms Dictionary, Definitions Search |
0-9
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z |
NP-hard definition
<complexity > A set or property of computational search
problems. A problem is NP-hard if solving it in polynomial
time would make it possible to solve all problems in class
NP in polynomial time.
Some NP-hard problems are also in NP (these are called
"NP-complete"), some are not. If you could reduce an NP
problem to an NP-hard problem and then solve it in polynomial
time, you could solve all NP problems.
See also computational complexity.
[Examples?]
(1995-04-10)
Nearby terms:
np « NPC « NP-complete « NP-hard » NPL » NPPL » N-Prolog
computer dictionary, computer terms dictionary, online computer dictionary, computer definition dictionary online, microsoft computer dictionary fifth edition, computer lingo dictionary, computer terminology dictionary, computer computer dictionary dictionary internet internet terms terms, barrons business computer dictionary dictionary internet terms, abbreviation computer dictionary lingo, computer dictionary edition new tenth websters world, computer dictionary with terms and definition, computer science dictionary, american computer dictionary house language random sign websters, dictionary computer internet terms, microsoft computer dictionary, computing dictionary [
Home
Law Dictionary ] [
Financial Dictionary ] [
Medical Dictionary ] [
Computer Dictionary ] Hot Links : Electronic Tutorials Information Encyclopedia Directory Science Projects Indian Food Recipes Hot Game Cheater , Love & Romance Attachments Krrish Game for PC
Best Online Dictionary .com
