(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.

(graph theory) A graph where every pair of vertices is connected by an edge.

plural of complete graph

(algebra) A partially ordered set in which all subsets have both a supremum (join) and an infimum (meet).

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

The state or condition of being NP-complete.

(mathematical analysis) Of a set, that it is metrizable and, under such given metric, complete.

(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.

(computing theory) The set of such problems.

plural of complete lattice