Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions

DOI10.1142/S0218127419501724zbMath1432.94226OpenAlexW2990582583MaRDI QIDQ4973588

QinBin He, Fangyue Chen

Publication date: 28 November 2019

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127419501724

zbMATH Keywords

decomposition structure figureimproved distance and DNA-like decomposition algorithmlinearly separable Boolean functionnonlinearly separable Boolean functionuniversal perceptron

Mathematics Subject Classification ID

Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items (2)

Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions ⋮ Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
• Realization of Boolean Functions via CNN: Mathematical Theory, LSBF and Template Design
• REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions