6274 search results - page 12 / 1255 » From query complexity to computational complexity |
STACS
2009
Springer
2009
Springer
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
14 years 4 months ago
ICCV
1995
IEEE
14 years 1 months ago
1995
IEEE
ACL
2011
13 years 1 months ago
2011
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...