30 search results - page 1 / 6 » The 1-Versus-2 Queries Problem Revisited |
MST
2010
12 years 11 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
NAACL
2010
13 years 2 months ago
2010
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
ICDT
2005
ACM
13 years 10 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
CIKM
2009
Springer
13 years 9 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...