On the complexity of approximating the VC dimension

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 660-671

  Mossel, Elchanan ^a   Umans, Christopher ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SPECTRUM ANALYSIS;

AFFINE PROJECTIONS; LINEAR FUNCTIONS; LOWER BOUNDS; SYMMETRIC POLYNOMIALS;

APPROXIMATION THEORY;

EID: 23844490169     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00022-3     Document Type: Conference Paper

References (22)

1. N. Alon, On the density of sets of vectors, Discrete Math. 46 (1983) 199-202.
2. L. Babai, S. Moran, Arthur-Merlin games: a randomized proof system, and a hierarachy of complexity classes, J. Comput. System Sci. 36 (1988) 254-276.
3. C. Bennett, G. Brassard, J. Robert, Privacy amplification by public discussion, SIAM J. Comput. 17 (2) (1988) 210-229.
4. B. Chor, J. Friedman, O. Goldreich, J. Hastad, S. Rudich, R. Smolensky, The bit extraction problem or t-resilient functions, in: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS 85), Portland, OR, 1985, pp. 396-407.
5. V. Guruswami, P. Indyk, Expander-based constructions of efficiently decodable codes, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 658-667.
6. V. Guruswami, M. Sudan, List decoding algorithms for certain concatenated codes, in: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), Portland, OR, 2000.
7. J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, in: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), White Plains, NY, 1988, pp. 68-80.
8. M.G. Karpovsky, V. Milman, Coordinate density of sets of vectors, Discrete Math. 24 (1978) 177-184.
9. K.-I. Ko, C.-L. Lin, Non-approximability in the polynomial-time hierarchy, Technical Report TR-94-2, Department of Computer Science, State University of New York at Stony Brook, 1994.
10. K.-I. Ko, C.-L. Lin, On the complexity of min-max optimization problems and their approximation, in: D.-Z. Du, P.M. Pardalos (Eds.), Minimax and Applications, Kluwer Academic Publishers, Dordrecht, 1995, pp. 219-239.
11. N. Linial, Y. Mansour, R.L. Rivest, Results on learnability and the Vapnik-Červonenkis dimension, in: Proceedings of FOCS, White Plains, NY, 1988, pp. 120-129.
12. N. Nisan, A. Ta-Shma, Extracting randomness: a survey and new constructions, J. Comput. System Sci. 58(1) (1999) 148-173.
13. C.H. Papadimitriou, M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci. 53 (2) (1996) 161-170.
14. N. Sauer, On the density of families of sets, J. Combin. Theory, A 13 (1972) 145-147.
15. p-complete, J. Comput. System Sci. 58 (1) (1999) 177-182.
16. R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 648-657.
17. S. Shelah, A combinatorial problem: stability and order for models and theories in infinitary languages, Pacific J. Math. 41 (1972) 247-261.
18. M. Sipser, Expanders, randomness, or time versus space, J. Comput. System Sci. 36 (3) (1988) 379-383.
19. A. Ta-Shma, C. Umans, and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in: Proceedings of the 33rd ACM Symposium on Theory of computing (STOC), Hersonissos, Crete, Greece, 2001, pp. 143-152.
20. A. Ta-Shma, D. Zuckerman, S. Safra, Extractors from Reed-Muller codes, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 638-647.
21. p minimization problems, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 99), New York, NY, 1999, pp. 465-474.
22. U. Vazirani, Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Combinatorica 7 (4) (1987) 375-392.