On the classification of Boolean functions.

MaRDI QIDQ3456078zbMATH OpenFDO

Authors Slavcho Shtrakov, Ivo Damyanov

Publication date 11 December 2015

zbMATH Keywords

algorithmsBoolean functionscomplexity measuresimplementationsseparable setssubfunctions

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Universal affine classification of Boolean functions
• A group algebraic approach to NPN classification of Boolean functions
• scientific article; zbMATH DE number 3912285
• On the representation of the inertia group of Boolean functions in a symmetric group
• The class of 1-balanced functions and the complexity of its realization

Cited in

(15)

• Universal affine classification of Boolean functions
• The class of 1-balanced functions and the complexity of its realization
• Separation results for Boolean function classes
• A group algebraic approach to NPN classification of Boolean functions
• Closed classes of Boolean functions. 2nd ed.
• On the computational complexity of finite operations
• Heuristic NPN classification for large functions using AIGs and LEXSAT
• On a new classification of Boolean functions
• scientific article; zbMATH DE number 3912285 (Why is no real title available?)
• Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates
• A spectral algorithm for 3-valued function equivalence classification
• Invertible Boolean Functions
• On the upper bounds for complexities of discrete functions
• An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
• Classification of Boolean functions by the invariants of their matrix representation

This page was built for publication: On the classification of Boolean functions.

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