A Lower Bound for Families of Natarajan Dimension d
暂无分享,去创建一个
[1] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[2] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.
[3] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1993, Comb..
[5] Martin Anthony,et al. Computational Learning Theory , 1992 .
[6] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.
[7] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .
[8] Miklós Simonovits,et al. Supersaturated graphs and hypergraphs , 1983, Comb..
[9] Steven Roman,et al. A Problem of Zarankiewicz , 1975, J. Comb. Theory, Ser. A.
[10] Philip M. Long,et al. A Generalization of Sauer's Lemma , 1995, J. Comb. Theory A.
[11] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[12] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[13] D. Pollard. Empirical Processes: Theory and Applications , 1990 .
[14] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..