Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions

DOI10.1016/j.ins.2023.120020OpenAlexW4390064699MaRDI QIDQ6153220

No author found.

Publication date: 13 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.120020

zbMATH Keywords

topological equivalenceconformal transformationbalanced linearly separable Boolean function (BLSBF)inseparable factorminimal subsystem (MS)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning points by parallel planes
• Diagnosing double regular systems
• A novel method for speed training acceleration of recurrent neural networks
• Majority Decision Functions of up to Six Variables
• REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
• Realization of Boolean Functions via CNN: Mathematical Theory, LSBF and Template Design
• Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions
• Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions
• REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• Enumeration of Threshold Functions of Eight Variables
• Breaker Page
• A logical calculus of the ideas immanent in nervous activity
• Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube

This page was built for publication: Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions