epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials

[1]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[2]  Endre Szemerédi,et al.  Constructing Small Sets that are Uniform in Arithmetic Progressions , 1993, Combinatorics, Probability and Computing.

[3]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[4]  E. Szemerédi,et al.  Construction of a thin set with small fourier coefficients , 1990 .

[5]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[7]  N. Katz.  An estimate for character sums , 1989 .

[8]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[9]  Marek Karpinski,et al.  The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.