21 search results - page 2 / 5 » The Quantum Query Complexity of Algebraic Properties |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
COCO
2001
Springer
13 years 12 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
AMW
2009
13 years 8 months ago
2009
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
ISCI
2008
13 years 7 months ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...