Explicit dimension reduction and its applications

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 262-272

  Karnin, Zohar S ^a   Rabani, Yuval ^b   Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DERANDOMIZATION; DIMENSION REDUCTION; LINEAR THRESHOLD FUNCTIONS; MAX CUT; PROBABILISTIC ARGUMENTS; PSEUDORANDOM GENERATORS; SAMPLE SPACE;

COMPUTATIONAL COMPLEXITY; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; SPHERES;

APPROXIMATION ALGORITHMS;

EID: 80051970609     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.20     Document Type: Conference Paper

References (33)

1. D. Achlioptas. Database-friendly random projections: Johnson- Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
2. N. Ailon and B. Chazelle. The fast Johnson- Lindenstrauss transform and approximate nearest neighbors. SIAM Journal on Computing, 39(1):302-322, 2009.
3. N. Ailon and E. Liberty. Fast dimension reduction using Rademacher series ondual bch codes. Discrete and Computational Geometry, 42:615-630, 2009.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
5. S. Arora and B. Barak. Computational complexity: a modern approach. Cambridge University Press, 2009.
6. B. Chazelle. The discrepancy method: randomness and complexity. Cambridge University Press, New York, NY, USA, 2000.
7. K.L. Clarkson and D.P. Woodruff. Numerical linear algebra in the streaming model. In Proceedings of the 41st annual ACM symposium on Theory of computing, pages 205-214. ACM, 2009.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9:251-280, 1990.
9. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
10. P. Diaconis and D. Freedman. A dozen de Finettistyle results in search of a theory. Annales de l'IHP Probabilités et statistiques, 23:397-423, 1987.
11. I. Diakonikolas, P. Gopalan, R. Jaiswal, R. A. Servedio, and E. Viola. Bounded independence fools halfspaces. SIAM Journal on Computing, 39(8):3441-3462, 2010.
12. I. Diakonikolas, D.M. Kane, and J. Nelson. Bounded independence fools degree-2 threshold functions. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 11-20, 2010.
13. L. Engebretsen, P. Indyk, and R. O'Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 705-712, 2002.
14. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM), 42(6):1115-1145, 1995.
15. O. Goldreich. Foundations of cryptography: basic tools. Cambridge University Press, 2001.
16. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh- Vardy codes. Journal of the ACM (JACM), 56(4):1-34, 2009.
17. 1. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 615-620, 2007. (Pubitemid 47630780)
18. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz maps into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
19. W.B. Johnson and A. Naor. The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. Discrete and Computational Geometry, 43(3):542-553, 2010.
20. D.M. Kane and J. Nelson. A derandomized sparse Johnson-Lindenstrauss transform. Arxiv preprint arXiv:1006.3585, 2010.
21. D. R. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM (JACM), 45(2):246-265, 1998. (Pubitemid 128505780)
22. Z. S. Karnin, Y. Rabani, and A. Shpilka. Explicit dimension reduction and its applications. Electronic Colloquium on Computational Complexity (ECCC), (121), 2009.
23. M. J. Kearns and U. V. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, USA, 1994.
24. S. Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28(5):1641-1663, 1999. (Pubitemid 129304146)
25. J. Matousek. On variants of the Johnson-Lindenstrauss lemma. Random Structures and Algorithms, 33(2):142-156, 2008.
26. R. Meka. Almost optimal explicit Johnson-Lindenstrauss transformations. Electronic Colloquium on Computational Complexity (ECCC), (183), 2010.
27. R. Meka and D. Zuckerman. Pseudorandom generators for polynomial threshold functions. http://arxiv.org/abs/0910.4122, 2009.
28. R. Meka and D. Zuckerman. Pseudorandom generators for polynomial threshold functions. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 427-436, 2010.
29. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
30. Y. Rabani and A. Shpilka. Explicit construction of a small ε-net for linear threshold functions. SIAM Journal on Computing, 39(8):3501-3520, 2010.
31. R. Shaltiel. Recent developments in extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, June 2002.
32. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 619-626, 2002. (Pubitemid 35009423)
33. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11(4):345-367, 1997. (Pubitemid 127345393)