308 search results - page 14 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
103
click to vote
JACM
2006
14 years 11 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
DCC
2000
IEEE
14 years 11 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
203
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...