A group algebraic approach to NPN classification of Boolean functions

DOI10.1007/s00224-018-9903-0zbMath1462.94074OpenAlexW2902437359WikidataQ128864595 ScholiaQ128864595MaRDI QIDQ2322710

Tian Liu, Juling Zhang, William N. N. Hung, Xiaoyu Song, Guo-wu Yang, Marek A. Perkowski

Publication date: 5 September 2019

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-018-9903-0

zbMATH Keywords

group theoryBoolean functioncycle type of a permutationnonequivalent coloringNPN classification

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (max. 100)

Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\) ⋮ A new pairwise NPN Boolean matching algorithm based on structural difference signature

Uses Software

• OEIS
• PlanetMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
• Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism
• A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• Automata, Languages and Programming
• On The Number of Symmetry Types of Boolean Functions of n Variables

This page was built for publication: A group algebraic approach to NPN classification of Boolean functions