Show Summary Details

Quick Reference

1 of a set, S, with respect to some universal set U. The set consisting of elements that are in U but not in S; it is usually denoted by S′, ~S, or . Formally, S′ = {x | (xU) and (xS)} The process of taking complements is one of the basic operations that can be performed on sets.

S′ = {x | (xU) and (xS)}

The set difference (or relative complement) of two sets S and T is the set of elements that are in S but not in T; it is usually written as ST. Thus S′ = US See also operations on sets.

S′ = US

2 See Boolean algebra.

3 of a subgraph G′, with vertices V′ and edges E′, of a graph G, with vertices V and edges E. The subgraph consisting of the vertices V and the edges in E but not in E′.

4 See radix-minus-one complement. See also radix complement, complement number system.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.