Bounds on the Size of Test Sets for Sorting and Related Networks

@inproceedings{Chung1987BoundsOT,
  title={Bounds on the Size of Test Sets for Sorting and Related Networks},
  author={Moon-Jung Chung and Bala Ravikumar},
  booktitle={ICPP},
  year={1987}
}
(iii) The size of the smallest test set to test if a network with n inputs is a sorter is exactly (2” n 1) if 0, l-inputs are used and exactly ( tny2,) 1 if permutations of (12 3 . . . n) are used as inputs. The size of the smallest test set to test if a network is a (k, n)-selector is exactly C&, (7) k 1 for 0,l inputs and (minC (:,a~,~)) 1 for permutation… CONTINUE READING