On the complexity of approximating the VC dimension

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 220-225

  Mossel, E ^a   Umans, C ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; COMPUTABILITY AND DECIDABILITY; DECISION THEORY; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; FORMAL LANGUAGES; POLYNOMIALS; SET THEORY; THEOREM PROVING;

LIST DECODABLE CODES; RANDOMNESS EXTRACTION PROBLEM; VC DIMENSION;

COMPUTATIONAL COMPLEXITY;

EID: 0034876625     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes
2. Free bits, PCP's and non-approximability - Towards tight results
3. Privacy amplicifcation by public discussion
4. The bit extraction problem or t-resilient functions
5. List decoding algorithms for certain concatenated codes
6. The influence of variables on boolean functions
7. Non-approximability in the polynomial-time hierarchy
8. On the complexity of min-max optimization problems and their approximation
9. Results on learnability and the Vapnik-Červonenkis dimension
10. Extracting randomness: A survey and new constructions
11. On limited nondeterminism and the complexity of the V-C dimension
12. On the density of families of sets
13. p-complete
14. A combinatorial problem: Stability and order for models and theories in infinitary languages
15. Expanders, randomness, or time versus space
16. Unbalanced expanders and improved extractors and dispersers. To appear
17. Construction of extractors using pseudorandom generators
18. p minimization problems
19. On the uniform convergance of relative frequencies of events to their probability
20. Strong communication complexity or generating quasi-random sequences from two communicating semirandom sources