3341 search results - page 418 / 669 » On Bounded Queries and Approximation |
195
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
158
click to vote
ORL
2010
15 years 1 months ago
2010
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
179
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
179
click to vote
ECCC
2008
15 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
189
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...