describing a level or quality of difficulty; the connotation is

often `more so than it should be' (NP-complete problems all seem

to be very hard, but so far no one has found a good a priori

reason that they should be.) "Coding a BitBlt implementation to

perform correctly in every case is NP-annoying." This is

generalized from the computer-science terms `NP-hard' and

`NP-complete'. NP is the set of Nondeterministic-Polynomial

algorithms, those that can be completed by a nondeterministic

Turing machine in an amount of time that is a polynomial function

of the size of the input; a solution for one NP-complete problem

would solve all the others. Note, however, that the NP- prefix is,

from a complexity theorist's point of view, the wrong part of

`NP-complete' to connote extreme difficulty; it is the completeness,

not the NP-ness, that puts any problem it describes in the

`hard' category.

-- The AI Hackers Dictionary

- NP- /N-P/ pref.
Extremely. Used to modify adjectives
describing a level or quality of difficulty

he connotation is often `more so than it should be' This is generalized from the computer-science terms `NP-hard' and `NP-complete'... - AI-complete /A-I k*m-pleet'/ adj.
[MIT, Stanford

by analogy with `NP-complete' (see NP-)] Used to describe problems or subproblems in AI, to indicate that the solution presupposes a solution to the `strong AI problem' (that is, the synthesis of a human-level intelligence).... - AI-complete: /A-I k*m-pleet'/ [MIT, Stanford: by analogy with
`NP-complete' (see {NP-})] adj.

Used to describe problems or subproblems in AI, to indicate that the solution presupposes a solution to the `strong AI problem' (that is, the synthesis of a human-level intelligence).... - brute force adj.
Describes a primitive programming style

one in which the programmer relies on the computer's processing power instead of using his or her own intelligence to simplify the problem, often ignoring problems of scale and applying naive methods suited to small problems directly to large ones.... - At about 2500 A.D., humankind discovers a computer problem that *must* be
solved.

The only difficulty is that the problem is NP complete and will take thousands of years even with the latest optical biologic technology available.... - The algorithm for finding the longest path in a graph is NP-complete.

For you systems people, that means it's *real slow*. -- Bart Mille... - proof by personal communication:
'Eight-dimensional colored cycle stripping is NP-complete
[Karp, personal communication].

' proof by reduction to the wrong problem: 'To see that infinite-dimensional colored cycle stripping is decidable, we reduce it to the halting problem.... - ontrivial: adj. Requiring real thought or significant computing
power.

Often used as an understated way of saying that a problem is quite difficult or impractical, or even entirely unsolvable ("Proving P=NP is nontrivial").... - proof by obfuscation:
A long plotless sequence of true and/or meaningless
syntactically related statements.

proof by wishful citation: The author cites the negation, converse, or generalization of a theorem from the literature to support his claims....