FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
