(computing theory) 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.

(computing theory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP

(computing theory) Both NP-easy and NP-hard.

(Australian politics) Abbreviation of Liberal / National parties. (coalition)

(US, radio) Initialism of National Public Radio. / (pressure cooking): Initialism of Natural Pressure Release.

(Wikimedia jargon) Initialism of neutral point of view - the guideline of all Wikipedia and Wiktionary articles.

Initialism of National Physical Laboratory. / Initialism of non-performing loan.

Initialism of National Prescription Audit. / (Philippines) Initialism of New People's Army.

(US) Initialism of National Paint and Coatings Association.

Initialism of National Police and Troopers Association.