419 search results - page 17 / 84 » Succincter |
192
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...
250
click to vote
CPM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
204
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
IACR
2011
14 years 6 months ago
2011
