TY - JOUR
T1 - Almost optimal dispersers
AU - Ta-Shma, Amnon
PY - 2002
Y1 - 2002
N2 - A (K, ε) disperser is a bipartite graph G= (V1, V2, E) with the property that every subset A of V1 of cardinality at least K, has at least 1-ε fraction of the vertices of V2 as neighbors. Such graphs have many applications in derandomization. Saks, Srinivasan and Zhou presented an explicit construction of a (K = 2k, ε) disperser G: (V1 = [2n], V2, E) with an almost optimal degree D = poly(n/ε), for every k ≥ nω(1). We extend their result for every parameter k ≥ poly log (n/ε).
AB - A (K, ε) disperser is a bipartite graph G= (V1, V2, E) with the property that every subset A of V1 of cardinality at least K, has at least 1-ε fraction of the vertices of V2 as neighbors. Such graphs have many applications in derandomization. Saks, Srinivasan and Zhou presented an explicit construction of a (K = 2k, ε) disperser G: (V1 = [2n], V2, E) with an almost optimal degree D = poly(n/ε), for every k ≥ nω(1). We extend their result for every parameter k ≥ poly log (n/ε).
UR - http://www.scopus.com/inward/record.url?scp=0036435072&partnerID=8YFLogxK
U2 - 10.1007/s004930200006
DO - 10.1007/s004930200006
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036435072
SN - 0209-9683
VL - 22
SP - 123
EP - 145
JO - Combinatorica
JF - Combinatorica
IS - 1
ER -