102 search results - page 10 / 21 » Bounded Query Functions with Limited Output Bits |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...