1. Ben-David, S., Cesa-Bianchi, N., Hausslkr, D., and Long, P.M.: ‘Characterizations of learnability of {0, …, n}-valued functions’, J. Comput. Syst. Sci. 50,no. 1 (1995), 74–86.
2. Holden, S.B.: ‘Neural networks and the VC-dimension’, in J.G. McWhirter (ed.): Mathematics in Signal Processing, Vol. III, Oxford Univ. Press, 1994, pp. 73–84.
3. Kranakis, E., Krizanc, D., Ruf, B., Urrutia, J., and Wöginger, G.: ‘The VC-dimension of set systems defined by graphs’, Discr. Appl. Math. 77,no. 3 (1997), 237–257.
4. Maass, W.: ‘Perspectives of current research about the complexity of learning on neural nets’, in V. Roychowdhury et al. (eds.): Theoretical Advances in Neural Computation and Learning, Kluwer Acad. Publ., 1994, pp. 295–336.
5. Naiman, D.Q., and Wynn, H.P.: ‘Independence number and the complexity of families of sets’, Discr. Math. 154 (1996), 203–216.