2479 search results - page 335 / 496 » Quantum complexity theory |
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
317
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
322
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
157
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
159
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...