Communications of the ACM
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Theory of linear and integer programming
Theory of linear and integer programming
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
What size net gives valid generalization?
Neural Computation
Training a 3-node neural network is NP-complete
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
Parallel distributed processing: explorations in the microstructure, vol. 2: psychological and biological models
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Remarks on interpolation and recognition using neural nets
NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
On the computational power of sigmoid versus boolean threshold circuits (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Finiteness results for sigmoidal “neural” networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Feedforward nets for interpolation and classification
Journal of Computer and System Sciences
How fast can a threshold gate learn?
Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects: constraints and prospects
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Parallel Computation with Threshold Functions
Proceedings of the Conference on Structure in Complexity Theory
Depth efficient neural networks for division and related problems
IEEE Transactions on Information Theory
Finiteness results for sigmoidal “neural” networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the power of polynomial discriminators and radial basis function networks
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient learning of continuous neural networks
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Neural networks with local receptive fields and superlinear VC Dimension
Neural Computation
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Vapnik-chervonenkis generalization bounds for real valued neural networks
Neural Computation
Analog versus discrete neural networks
Neural Computation
Lower bounds for the computational power of networks of spiking neurons
Neural Computation
MUSP'09 Proceedings of the 9th WSEAS international conference on Multimedia systems & signal processing
Designing neural networks for tackling hard classification problems
WSEAS TRANSACTIONS on SYSTEMS
Estimating the size of neural networks from the number of available training data
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Hi-index | 0.00 |