Tytuł artykułu
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
25--37
Opis fizyczny
bibliogr. 13 poz.
Twórcy
autor
autor
autor
autor
- BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foun-dation, Department of Computer Science, University of Aarhus
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0007-0027