2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

@inproceedings{Barak20062sourceDF,
  title={2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction},
  author={Boaz Barak and Anup Rao and Ronen Shaltiel and Avi Wigderson},
  booktitle={STOC},
  year={2006}
}
The main result of this paper is an explicit disperser for two independent sources on n bits, each of entropy k=no(1). Put differently, setting N=2n and K=2k, we construct explicit N x N Boolean matrices for which no K x K submatrix is monochromatic. Viewed as adjacency matrices of bipartite graphs, this gives an explicit construction of K-Ramsey bipartite graphs of size N.This greatly improves the previous bound of k=o(n) of Barak, Kindler, Shaltiel, Sudakov and Wigderson [4]. It also… CONTINUE READING
Highly Cited
This paper has 115 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

116 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 116 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

On a Problem of Formal Logic

  • F. P. Ramsey
  • Proceedings of the London Mathematical Society…
  • 1928
Highly Influential
19 Excerpts

A Simple Explicit Construction of an nÕ(log n)-Ramsey Graph

  • B. Barak
  • Technical report, Arxiv,
  • 2006
Highly Influential
18 Excerpts

Similar Papers

Loading similar papers…