Key points are not available for this paper at this time.
ASSTRACT. Let U1 , U2, . . . , Ud be totally ordered sets and let V be a set of n d-dimensional vectors In U~ X Us. . X Ud . A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational complexity of the problem is defined to be the number of required comparisons of two components and
Kung et al. (Wed,) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: