308 search results - page 1 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
ICALP
2001
Springer
14 years 3 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
COCO
2001
Springer
14 years 3 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...