32 search results - page 2 / 7 » approx 2005 |
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...