subset

RU: подмножество

Set A is a subset of set B (written A ⊆ B) if every element of A is also in B. The empty set is a subset of every set; a set is a subset of itself. In algorithm problems, enumerating all subsets of an n-element set produces 2ⁿ subsets — a key fact behind exponential-time backtracking solutions.