Aizenstein H, Hegedus T, Hellerstein L, Pitt L. (1998). Theoretic hardness results for query learning Computational Complexity. 7

Amaldi E. (1991). On the complexity of training perceptrons Proceedings of the 1st International Conference on Artificial Neural Networks (ICANN91).

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

Cook SA. (1971). The complexity of theorem proving procedures Proc. 3rd ACM Symp. on Theory of Computing.

Diaz J, Balcazar JL, Gabarro J. (1995). Structural complexity I (2nd ed).

Garey MR, Johnson DS. (1979). Computers and intractability: A guide to the theory of NP-completeness.

Hammer PL, Ibaraki T, Peled UN. (1981). Threshold numbers and threshold completions Studies on graphs and discrete programming, Annals of Discrete Mathematics. 11

Haussler D, Warmuth MK, Ehrenfeucht A, Blumer A. (1989). Learnability and the Vapnik-Chervonenkis dimension Journal Of The ACM. 36

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

Hegedus T, Megiddo N. (1996). On the geometric separability of Boolean functions Discrete Applied Mathematics. 66

Hoffgen KU, Simon HU, Vanhorn KS. (1995). Robust trainability of single neurons J Computer Sys Sci. 50

Johnson DS, Preparata FP. (1978). The densest hemisphere problem Theoretical Computer Science. 6

Judd JS. (1990). Neural network design and the complexity of learning.

Kistler WM, Gerstner W. (2002). Spiking neuron models.

La_Poutre H, Bohte M, Kok JN. (2000). Spike-prop: Error-backpropagation in multi-layer networks of spiking neurons Proceedings of the European Symposium on Artificial Neural Networks (ESANN2000).

Lebiere C, Fahlman SE. (1990). The cascade-correlation learning architecture Advances in neural information processing systems. 2

Maass W. (1996). Networks of spiking neurons: The third generation of neural network models Neural Networks. 10

Maass W, Bishop CM. (1999). Pulsed Neural Networks..

Maass W, Schmitt M. (1999). On the complexity of learning for spiking neurons with temporal coding Inform Comput. 153

Orlitsky A, Roychowdhury VP, Siu KY. (1994). Theoretical advances in neural computation and learning.

ROSENBLATT F. (1958). The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review. 65 [PubMed]

Roychowdhury VP, Siu KY, Kailath T. (1995). Classification of linearly nonseparable patterns by linear threshold elements. IEEE transactions on neural networks. 6 [PubMed]

Schmitt M. (1998). On computing Boolean functions by a spiking neuron Ann Math Artif Intell. 24

Sima J. (2003). On the complexity of training a single perceptron with programmable synaptic delays Proceedings of the 14th International Conference on Algorithmic Learning Theory (ALT2003). 2842

Síma J. (2002). Training a single sigmoidal neuron is hard. Neural computation. 14 [PubMed]

Valiant LG. (1984). A theory of the learnable Communications Of The ACM. 27

Valiant LG, Pitt L. (1988). Computational limitations on learning from examples Journal Of The ACM. 35

Vidyasagar M. (1997). A theory of learning and generalization.