An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
From MaRDI portal
Publication:6181734
DOI10.1007/978-3-030-20323-8_9zbMath1528.94132OpenAlexW2960547283MaRDI QIDQ6181734
D. Michael Miller, Mathias Soeken
Publication date: 23 January 2024
Published in: Advanced Boolean Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-20323-8_9
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic minimization techniques with applications to cryptology
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
- Enumeration of Reversible Functions and Its Application to Circuit Complexity
- The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis
- A Classification of the Cosets of the Reed-Muller Code R (1, 6)
- On the Classification of Boolean Functions by the General Linear and Affine Groups
This page was built for publication: An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions