Lines Matching full:subset

43 	1) for any set S, there is a maximal non-shifting subset of S
46 subset of S.  That subset is also non-shifting and it can be calculated
115 If mount m is forbidden in a set S, it is forbidden in any subset S' it
118 there's none, we could use it to find the maximal non-shifting subset
183 The following will reduce S to its maximal non-shifting subset:
196 the maximal non-shifting subset, since we were removing only forbidden
262 One useful observation is that we are given a closed subset in S - the
266 In other words, the elements of that subset will remain in S until
267 the end and Trim_one(S, m) is a no-op for all m from that subset.
272 to iterate through.  Let's represent it as a subset in a cyclic list,
344 locked, we can immediately move m into the committed subset (remove
347 when we get to building the non-revealing subset.
351 If S is not a non-revealing subset, there is a locked element x in S
354 Obviously, no non-revealing subset of S may contain x.  Removing such
356 subset (possibly empty one).  Note that removal of an element will
371 // to unmount) and a set of candidates, represented as a subset of list
375 // subset of S is now in U
403 may be elements of a non-revealing subset of S.
405 of {x_0, ..., x_{k-1}} may be an element of a non-revealing subset of
410 U still contains any non-revealing subset of S and after the call of
413 leaving U the maximal non-revealing subset of S.
440 	* trim down to maximal non-shifting subset
441 	* trim down to maximal non-revealing subset
446 non-revealing subset, initially containing the original set ("U" in
455 	* undecided candidates ("candidates").  Subset of a list,