Sciweavers

16 search results - page 4 / 4
» On Derandomizing Probabilistic Sublinear-Time Algorithms
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko