(computing theory) The set of such problems.

(computing theory, of a decision problem) That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).

A street that successfully caters for pedestrians, bicyclists, and mass transit users as well as automobile users.

plural of complete street

plural of complete lattice

(mathematics) The following axiom (applied to an ordered field): for any subset of the given ordered field, if there is any upper bound for this subset, then there is also a supremum for this subset, and this supremum is an element of the given ordered field (though not necessarily of the subset).

(mathematical analysis) A σ-algebra which is obtained as a "completion" of a given σ-algebra, which includes all subsets of the given measure space which simultaneously contain a member of the given σ-algebra and are contained by a member of the given σ-algebra, as long as the contained and containing measurable sets have the same measure, in which case the subset in question is assigned a measure equal to the common measure of its contained and containing measurable sets (so the measure is also being completed, in parallel with the σ-algebra).

(mathematical analysis) A measure such that, for every set of measure zero belonging to its domain, all subsets of that set are also assigned measure zero by the given measure.

(programming, uncountable) Autocompletion of source code. / (programming) A token predicted by means of autocompletion.

plural of complete protein