308 search results - page 2 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
COCO
2004
Springer
13 years 9 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...