493 search results - page 14 / 99 » Quantum Query Complexity of Some Graph Problems |
109
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
106
click to vote
LICS
2012
IEEE
13 years 13 hour ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
105
click to vote
DISOPT
2010
14 years 9 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
AI
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
102
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...