Explicit construction of a small epsilon-net for linear threshold functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 649-658

  Rabani, Yuval ^a   Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Epsilon net; Explicit construction; Linear threshold function

Indexed keywords

BCH CODE; COVERING RADIUS; EPSILON-NET; EXPLICIT CONSTRUCTION; EXPLICIT CONSTRUCTIONS; LINEAR THRESHOLD FUNCTION; LINEAR THRESHOLD FUNCTIONS; PROBABILISTIC ARGUMENTS;

POLYNOMIALS;

COMPUTATION THEORY;

EID: 70350694417     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536502     Document Type: Conference Paper

References (25)

1. and P.Sarnak A. Lubotzky, R. Phillips. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
2. N. Alon. Private communication, 2008.
3. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Computational Complexity, 5(1):60-75, 1995.
4. N. Alon, G. Gutin, and M. Krivelevich. Algorithms with large domination ratio. J. Algorithms, 50(1):118-131, 2004.
5. N. Alon, H. Kaplan, G. Nivasch, M. Sharir, and S. Smorodinsky. Weak ε-nets and interval chains. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 1194-1203, 2008.
6. N. Alon and J. Spencer. the probabilistic method. J. Wiley, 3 edition, 2008.
7. B. Berger. The fourth moment method. SIAM J. Comput., 26(4):1188-1207, 1997.
8. E. J. Candés and T. Tao. Near-optimal signal recovery from random projections: universal encoding strategies. IEEE Trans. Inform. Theory, 52(12):5406-5425, 2006.
9. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143-154, 1979.
10. B. Chazelle. Computational geometry: a retrospective. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (STOC), pages 75-94, 1994.
11. D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
12. L. Engebretsen, P. Indyk, and R. O'Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 705-712, 2002.
13. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic. Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 10-16, 1992.
14. M. L. Fredman, J. Komlós, and E. Szemerdi. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538-544, 1984.
15. n 1 via expander codes. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 353-362, 2008.
16. V. Guruswami, J. R. Lee, and A. Wigderson. Euclidean sections of with sublinear randomness and error-correction over the reals. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, pages 444-454, 2008.
17. P. Indyk. Uncertainty principles, extractors, and explicit embeddings of l2 into l1. In Proceedings of the 39th AnnualACM Symposium on Theory of Computing (STOC), pages 615-620, 2007.
18. W. B. Johnson and J. Lindenstrauss. Extensions of lipschitz maps into a hilbert space. Contemporary Mathematics, 26:189U206, 1984.
19. N. Linial, M. Luby, M. E. Saks, and D. Zuckerman. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica, 17(2):215-234, 1997.
20. G. A. Margulis. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problems of Information Transmission, 24(1):39-46, 1988.
21. J. Matousek. Lectures on discrete Geometry. GTM. springer, 2002.
22. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. on Computing, 22(4):838-856, 1993.
23. J. P. Schmidt and A. Siegel. The analysis of closed hashing under limited randomness (extended abstract). In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (STOC), pages 224-234, 1990.
24. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC), pages 619-626, 2002.
25. E. Viola. The sum of d small-bias generators fools polynomials of degree d. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), pages 124-127, 2008.