We prove that at least ...equivalence testes and no more than ... equivalence testes are needed in the worst case to identify the equivalence classes with at least k members in set of n elements. The upper bound is an improvement by a factor 2 compared to known results. For k=3 we give tighter bounds. Finally, for k>n/2 we prove that it is necessary and it suffices to make 2n-k-1 equivalence testes which generalizes a known result.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.