A representation of a finite set of bounded nonnegative integers by a binary word: bit is 1 exactly when belongs to the set. Bitwise AND, OR, and XOR implement intersection, union, and symmetric difference. A large integer can store the whole word when the programming language provides arbitrary-precision integers.
Articles by others on the same topic
There are currently no matching articles.