Anthony M, Bartlett PL. (1999). Neural network learning: Theoretical foundations.

Bartlett PL, Maiorov V, Meir R. (1998). Almost linear VC-dimension bounds for piecewise polynomial networks Neural computation. 10 [PubMed]

Ben-David S, Lindenbaum M. (1998). Localization vs. identification of semi-algebraic sets Mach Learn. 32

Erlich Y, Chazan D, Petrack S, Levy A. (1997). Lower bound on VC-dimension by local shattering Neural Comput. 9

Haussler D, Kearns M, Ehrenfeucht A, Valiant L. (1989). A general lower bound on the number of examples needed for learning Information And Computation. 82

Haykin S. (1999). Neural Networks: A Comprehensive Foundation (2nd Ed).

Karpinski M, Macintyre A. (1997). Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks J Computer Syst Sciences. 54

Karpinski M, Werther T. (1993). VC dimension and uniform learnability of sparse polynomials and rational functions SIAM Journal On Computing. 22

Littlestone N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm Mach Learn. 2

Maass W, Bartlett PL. (2003). Vapnik-Chervonenkis dimension of neural nets The handbook of brain theory and neural networks (2nd Ed).

Park J, Sandberg IW. (1991). Universal approximation using radial-basis-function networks Neural Comput. 3

Rumelhart DE, Durbin R. (1989). Product units: a computationally powerful and biologically plausible extension to backpropagation networks Neural Comput. 1

Schmitt M. (2002). Descartes' rule of signs for radial basis function neural networks. Neural computation. 14 [PubMed]

Schmitt M. (2002). Neural networks with local receptive fields and superlinear VC dimension. Neural computation. 14 [PubMed]

Schmitt M. (2002). On the complexity of computing and learning with multiplicative neural networks. Neural computation. 14 [PubMed]

Schmitt M. (2004). New designs for the Descartes rule of signs American Mathematical Monthly. 111

Sontag ED, Koiran P. (1997). Neural networks with quadratic VC dimension J Computer System Sciences. 54

Vapnik VN, Chervonenkis AY. (1971). On the uniform convergence of relative frequencies of events to their probabilities Theory Of Probability And Its Applications. 16

Williamson RC, Bartlett PL, Lee WS. (1995). Lower bounds on the VC dimension of smoothly parameterized function classes Neural Comput. 7

Oztop E. (2006). An upper bound on the minimum number of monomials required to separate dichotomies of {-1, 1}n. Neural computation. 18 [PubMed]