1. N. Alon and R. Beigel: Lower bounds for approximations by low degree polynomials over ℤm, Proceedings of the 16th IEEE Conference on Computational Complexity (CCC), 2001.
2. N. Alon: The Shannon capacity of a union, Combinatorica, 18 (1998), 301–310.
3. B. Barak: A simple explicit construction of an n õ(log n) Ramsey graph, arXiv.org, math.CO/0601651, 2006.
4. D. A. Barrington, R. Beigel and S. Rudich: Representing Boolean functions as polynomials modulo composite numbers, Computational Complexity, 4 (1994), 367–382.
5. L. Babai and P. Frankl: Linear Algebra Methods in Combinatorics, Preliminary version 2, 1992.