493 search results - page 91 / 99 » Quantum Query Complexity of Some Graph Problems |
105
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
115
click to vote
PODS
2011
ACM
14 years 13 days ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...