(Enter summary)
Abstract: We prove that at least - O(k) equivalence tests and no more than + O(n) equivalence tests 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 suces to make 2n - k - 1 equivalence tests which generalizes a known result for k = ⌈(n+1)/2⌉. (Update)
Context of citations to this paper: More
...is I r queries or BTO s. This can be shown to be very close to optimal using a worst case bound known for a related easier problem [2]. We use this result to generate supervision data for the algorithms described in Section 4.1 as follows: For algorithm (7) choose (at...
Cited by: More
Learning via Equivalence Constraints, with.. - Bar-Hillel..
(Correct)
Active bibliography (related documents): More All
1.1: The Complexity of Finding Replicas Using Equality Tests - Frandsen, Miltersen, Skyum (1993)
(Correct)
0.9: Dynamic Maintenance of Majority Information in Constant Time.. - Frandsen, Skyum
(Correct)
0.5: Induced Ramsey Numbers - Kohayakawa, Prömel, Rödl (1998)
(Correct)
Similar documents based on text: More All
1.7: Dynamic Algorithms for the Dyck Languages - Frandsen, Husfeldt, Miltersen.. (1995)
(Correct)
1.7: Worst Case Efficient Data Structures - Brodal (1997)
(Correct)
1.4: Dynamic Word Problems - Frandsen, Miltersen, Skyum (1993)
(Correct)
Related documents from co-citation: More All
2: Support Vector Machines applied to face recognition
- Phillips - 1998
2: Supervised learning of preference relations
- Herbrich, Graepel et al. - 1998
2: A mixture of experts classifier with learning based on both labelled and unlabel.. (context) - Miller, Uyar - 1997
BibTeX entry: (Update)
P. G. Binderup, G. S. Frandsen, P. Bro Miltersen, and S. Skyum. The complexity of identifying large equivalence classes. qBRICS RS 98-34, University of Aarhus, DK, 1998. 20 http://citeseer.ist.psu.edu/binderup98complexity.html More
@techreport{ binderup98complexity,
author = "P. Binderup and G. Frandsen and P. Miltersen and S. Skyum",
title = "The complexity of identifying large equivalence classes",
number = "RS 98--34",
institution = "BRICS, University of Aarhus, DK",
year = "1998",
url = "citeseer.ist.psu.edu/binderup98complexity.html" }
Citations (may not include all citations):
193
Extremal Graph Theory (context) - Bollob - 1978
24
A Note on Ramsey Numbers (context) - Ajtai, omlos et al. - 1980
23
Science of Computer Programming (context) - Misra, Gries et al. - 1982
11
On Computing Majority by Comparisons (context) - Saks, Werman - 1991
7
Information Processing Letters (context) - Alonso, Reingold et al. - 1993
5
Solution to problem (context) - Fischer, Salzburg - 1982
5
An Optimal Algorithm for the Majority Problem (context) - Matula - 1990
4
Journal of Algorithms (context) - Moore - 1981
3
Finding a Majority when Sorting is not available (context) - Campbell, McNeill - 1991
2
The Complexity of Finding Replicas using Equality Tests
- Frandsen, Miltersen et al. - 1993
2
London Mathematical Society Lecture Note Series 123 (context) - Graham, odl et al. - 1987
1
A Combinatorial Problem (context) - Binderup - 1998
Documents on the same site (http://www.brics.dk/RS/98/Ref/BRICS-RS-98-Ref/): More
The Hardness of Speeding-up Knapsack - Sen (1998)
(Correct)
On the (Im)possibility of Basing Oblivious Transfer.. - Damgård.. (1998)
(Correct)
Lower Bounds for Dynamic Algebraic Problems - Frandsen, al. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC