1. NP-hardNP-hard, in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP". A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H (i.e. , L ≤ TH). In other words, L can be solved in polynomial time by an oracle machine with an oracle for H.
Read “NP-hard” on English Wikipedia
Read “NP困難” on Japanese Wikipedia
Read “NP-hard” on DBpedia
Read “NP-hard” on English Wikipedia
Read “NP困難” on Japanese Wikipedia
Read “NP-hard” on DBpedia
Discussions
Log in to talk about this word.