Location of Repository

Topics:
QA76 Computer software

Publisher: IEEE

Year: 2006

DOI identifier: 10.1109/TNN.2006.872352

OAI identifier:
oai:eprints.lse.ac.uk:14969

Provided by:
LSE Research Online

- (1999). A theorem on sensitivity and applications in private computation,” in
- (1989). Almost optimal lower bounds for small depth circuits,”
- Antipredictable sequences: harder to predict thanrandomsequences,”NeuralComput.,vol.10,pp.2219–2230,1998.
- (1994). Circuit Complexity and Neural Networks.
- (2002). Computational complexity for physicists,”
- (1993). Constant depth circuits, Fourier transform and learnability,”
- (1991). Depth-size tradeoffs for neural computation,”
- (2006). Generalization ability of Boolean functions implemented in feedforward neural networks,” Neurocomputing,
- (2000). Generalization and selection of examples in feedforward neural networks,”
- (2001). Generalization properties of modular networks implementing the parity function,”
- (1991). Improved learning of AC functions,” in
- (2003). Learning capability and storage capacity of two-hiddenlayer feedforward networks,”
- (2000). Minimization of Boolean complexity in human concept learning,”
- (2002). Minimizing the average query complexityoflearningmonotoneBooleanfunctions,”INFORMSJ.Comput.,
- (1994). Networks: A Comprehensive Foundation:
- (1994). Neural models and spectral methods,”
- (1999). Neural Network Learning: Theoretical Foundations.
- (2004). Non-glassy ground state in a long-range antiferromagnetic frustrated model in the hypercubic cell,”
- (1995). On specifying Boolean functions by labeled examples,”
- On the computational complexity of ising spin glasses,”
- (1998). Periodic symmetric functions, serial addition, and multiplication with neural networks,”
- (1992). Polynomial threshold functions, AC functions, and spectral norms,”
- (1975). Randomness and mathematical proof,”
- (1993). Slicing the hypercube,” in Surveys
- (1965). Solving arithmetic problems using feedforward neural networks,”
- (1998). Statistical Learning Theory.
- (2001). Statistical mechanics methods and phase transitions in optimization problems,”
- (2000). Statistical mechanics, three-dimensionality and NP-completeness I. Universality of intractability for the partition function of the Ising model accross nonplanar lattices,” in
- (1993). The anisotropic kagome antiferromagnet: a topical spin glass?,”
- (1997). The average sensitivity of bounded-depth circuits,”
- (2000). The average sensitivity of square-freeness,”
- (1987). The Complexity of Boolean Functions.
- (1988). The inﬂuence of variables on Boolean functions,” in
- (1998). The sample complexity of pattern classiﬁcation with neural networks: the size of the weights is more important than the size of the network,”
- (1965). Three approaches to the quantitative deﬁnition of information,”
- (2001). V.Deolalikar,“MappingBooleanfunctionswithneuralnetworkshaving binary weights and zero thresholds,”

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.