Minimal feedforward parity networks using threshold gates
From MaRDI portal
Recommendations
- Realization of Logical Functions by a Network of Threshold Components with Specified Sensitivity
- Feed-Forward Threshold Logic Nets for Digital Switching and Pattern Recognition
- Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
- Minimal contact circuits for symmetric threshold functions
- Threshold circuits of small majority-depth
- Complexity and synthesis of minimal logic circuits using multiplexers
- The minimal test set for multioutput threshold circuits implemented as sorting networks
- Threshold circuits of bounded depth
- The minimal circuits for linear Boolean functions
Cited in
(8)- N-bit parity neural networks: new solutions based on linear programming
- Minimal MLPs do not model the XOR logic
- The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network
- How to choose an appropriate transfer function in designing a simplest ANN to solve specific problems
- A linear relation between input and first layer in neural networks
- Solving the XOR and Parity \(n\) problems using a single universal binary neuron
- The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
- scientific article; zbMATH DE number 3313265 (Why is no real title available?)
This page was built for publication: Minimal feedforward parity networks using threshold gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708445)
