N-bit parity neural networks: new solutions based on linear programming

DOI10.1016/S0925-2312(01)00612-9zbMATH Open1006.68779OpenAlexW2019024643MaRDI QIDQ1852001FDOQ1852001

Authors: Derong Liu, Myron E. Hohil, Stanley H. Smith 

Publication date: 9 January 2003

Published in: Neurocomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-2312(01)00612-9

Recommendations

• The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network
• Minimal feedforward parity networks using threshold gates
• scientific article; zbMATH DE number 1784856
• The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
• scientific article; zbMATH DE number 579564

zbMATH Keywords

Neural networks\(N\)-bit parity problemExclusive-OR problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Cited In (5)

• Unifying metric approach to the triple parity.
• The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network
• The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
• Title not available (Why is that?)
• Solving the XOR and Parity \(n\) problems using a single universal binary neuron

This page was built for publication: N-bit parity neural networks: new solutions based on linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852001)