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

See more from authors: Aizenstein H · Hegedus T · Hellerstein L · Pitt L

References and models cited by this paper
References and models that cite this paper

Síma J, Sgall J. (2005). On the nonlearnability of a single spiking neuron. Neural computation. 17 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.