6274 search results - page 180 / 1255 » From query complexity to computational complexity |
279
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
157
click to vote
MDM
2009
Springer
15 years 11 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
127
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
133
Voted
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
156
click to vote
KRDB
2003
15 years 5 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...