Np-hard



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)

Tagged:

Read Also:

  • Npi

    National Provider Identifier

  • NPK

    1. Horticulture. nitrogen, phosphorus, and potasium.



  • Npl

    abbreviation 1. National Physical Laboratory 1. New Programming Language. IBM’s original (temporary) name for PL/I, changed due to conflict with England’s “National Physical Laboratory.” MPL and MPPL were considered before settling on PL/I. Sammet 1969, p.542. 2. A functional language with pattern matching designed by Rod Burstall and John Darlington in 1977. The language allowed […]

  • Npm

    National Poetry Month



Disclaimer: Np-hard definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.