Minimal Feedforward Parity Networks Using Threshold Gates | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Minimal Feedforward Parity Networks Using Threshold Gates

Neural Computation (2001) 13 (2): 319–326.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Learning the N-Input Parity Function with a Single-Qubit and Single-Measurement Sampling

Antonia Tsili
Georgios Maragkopoulos
Aikaterini Mandilara
Dimitris Syvridis

Electronics (2025) 14 (5): 901.

On the Complexity of Neural Network Classifiers: A Comparison Between Shallow and Deep Architectures

Monica Bianchini
Franco Scarselli

IEEE Transactions on Neural Networks and Learning Systems (2014) 25 (8): 1553.

The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks

Yang Lu
Juan Yang
Qiang Wang
ZhenJin Huang

Science China Information Sciences (2012) 55 (7): 1579.

Universal Perceptron and DNA-Like Learning Algorithm for Binary Neural Networks: LSBF and PBF Implementations

IEEE Transactions on Neural Networks (2009) 20 (10): 1645.

Solving the XOR and parity N problems using a single universal binary neuron

Igor Aizenberg

Soft Computing (2007) 12 (3): 215.

Multilayer Feedforward Neural Network Based on Multi-valued Neurons (MLMVN) and a Backpropagation Learning Algorithm

Igor Aizenberg
Claudio Moraga

Soft Computing (2007) 11 (2): 169.

Generalization properties of modular networks: implementing the parity function

L. Franco
S.A. Cannas

IEEE Transactions on Neural Networks (2001) 12 (6): 1306.