「Non-empty」の共起表現一覧(1語右で並び替え)

Non-empty

1語右で並び替え

該当件数:28件

  • while S is nonempty and F is not yet spanning
  • ma, named after John Tukey, states that every nonempty collection of finite character has a maximal
  • concave in the sense that, for every pair of nonempty compact subsets A and B of Rn and every 0 ≤ t
  • em states that every contraction mapping on a nonempty complete metric space has a unique fixed poin
  • that if E is a normed vector space and K is a nonempty convex subset of E which is compact under the
  • validity of Horn formulas is preserved under nonempty direct products, and conjectured that the con
  • If C has nonempty interior, then C * is pointed, i.e.
  • axis-aligned orthants having p as apex has a nonempty intersection with S.
  • s are adjacent if and only if their sets have nonempty intersection, so a containment representation
  • hen be two disjoint faces whose images have a nonempty intersection.
  • X is sober, i.e. every nonempty irreducible closed subset of X has a (necessa
  • is Horn if and only if it is preserved under nonempty reduced products.
  • For nonempty relations, asymmetry in the second definition
  • Let S be a nonempty set and C be a nonempty subset.
  • he Cartesian product of an infinite set and a nonempty set is infinite.
  • terpretation is usually required to specify a nonempty set as the domain of discourse.
  • , he is known for the Smith set, the smallest nonempty set of candidates such that, in every pairwis
  • artition of all the points on a line into two nonempty sets such that no point of either lies betwee
  • and terminals) and γ ∈ (N U Σ)+ (i.e., γ is a nonempty string of nonterminals and terminals).
  • It is connected: any nonempty string may have its rank reduced by some oper
  • G is a nonempty subset of N that contains the goal states.
  • alent to P being converse well-founded: every nonempty subset of P has a maximal element (the maxima
  • is equivalent to P being well-founded: every nonempty subset of P has a minimal element (also calle
  • ined by adding up the elements of some finite nonempty subset of D. The set of all finite sums over
  • to partition the integers 1, 2, ..., n into k nonempty subsets such that all elements in each subset
  • bitrarily large sets of integers all of whose nonempty sums have the same color; the name was chosen
  • If G is strongly connected and E is nonempty, then
  • In particular, every nonempty tree contains the empty sequence.