Word:

NP-hard

(complexity)NP-hard - 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.

Browse
noxiousness
noxiptiline
Noy
Noyade
Noyance
Noyau
Noyer
Noyes
Noyful
Noyls
Noyous
Nozle
Nozzle
Np
NP time
NP-complete
-- NP-hard --
NPA
NPAC
NPC
NPD
NPDA
NPH
NPH insulin
NPI
NPL
NPM
NPMS
NPPL
NPSI
NPSS
NPTN
NPV
Definitions Index: # 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

About this site and copyright information - Online Dictionary Home