Outrageously Funny Word Dictionary :: Noninclusion

👉 In computational complexity theory, a "non-inclusion" or "non-implication" problem is a type of decision problem in which each member of a set has an equal probability of being included into a larger set. This contrasts with inclusion, where every member must be either included or excluded from the larger set. For example, consider a binary tree, and let's say we want to find out if there is a path that crosses through all leaves in the tree. The problem can be viewed

noninclusion