Author:
Johnson H. R.,Laskowski M. C.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference18 articles.
1. Assouad, P.: Densité et dimension. Ann. Inst. Fourier 33(3), 233–282 (1983)
2. Basu, S.: Combinatorial complexity in o-minimal geometry. In: Proc. of the 39th Ann. ACM Symp. on Theory of Computing, pp. 47–56 (2007)
3. Ben-David, S., Litman, A.: Combinatorial variability of Vapnik–Chervonenkis classes with applications to sample compression schemes. Discrete Appl. Math. 86(1), 3–25 (1998)
4. Dudley, R.M.: Uniform Central Limit Theorems. Cambridge University Press, New York (1999)
5. Floyd, S., Warmuth, M.: Sample compression, learnability, and the Vapnik–Chervonenkis dimension. Mach. Learn. 21(3), 269–304 (1995)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. VC density of definable families over valued fields;Journal of the European Mathematical Society;2021-03-17
2. On uniform definability of types over finite sets for NIP formulas;Journal of Mathematical Logic;2020-12-29
3. RAMSEY GROWTH IN SOME NIP STRUCTURES;Journal of the Institute of Mathematics of Jussieu;2019-02-19
4. MODEL THEORY AND MACHINE LEARNING;The Bulletin of Symbolic Logic;2019-02-15
5. Vapnik-Chervonenkis density in some theories without the independence property, I;Transactions of the American Mathematical Society;2015-12-22