Composition of Post classes and normal forms of Boolean functions

DOI10.1016/J.DISC.2006.06.014MaRDI QIDQ856872zbMATHOpenAlexFDO

Authors Miguel Couceiro, Stephan Foldes, Erkko Lehtonen

Publication date 14 December 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://basepub.dauphine.fr/handle/123456789/10177

zbMATH Keywords

mediancomplexitynormal formsBoolean functionsZhegalkin polynomialCNFclonesDNFternary majorityPost classesclass factorizationefficient representationsfunction class compositionReed-Muller polynomial

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On composition-closed classes of Boolean functions
• Compositions and clones of Boolean functions
• scientific article; zbMATH DE number 51303
• On Boolean primitive positive clones
• Criteria of decomposability of Post clones

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 4075052 (Why is no real title available?)
• scientific article; zbMATH DE number 4110759 (Why is no real title available?)
• scientific article; zbMATH DE number 1061261 (Why is no real title available?)
• scientific article; zbMATH DE number 1963548 (Why is no real title available?)
• scientific article; zbMATH DE number 1521609 (Why is no real title available?)
• scientific article; zbMATH DE number 3307508 (Why is no real title available?)
• scientific article; zbMATH DE number 3067721 (Why is no real title available?)
• A ternary operation in distributive lattices
• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• Function classes and relational constraints stable under compositions with cloness
• Median Algebra
• Median algebras
• Post classes characterized by functional terms
• Postulates For Distributive Lattices
• Ternary Boolean algebra
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Cited in

(9)

• A complete classification of equational classes of threshold functions included in clones
• Invariant continuous aggregation functions
• On composition-closed classes of Boolean functions
• On the efficiency of normal form systems for representing Boolean functions
• Characterizations of discrete Sugeno integrals as polynomial functions over distributive lattices
• Pivotal decompositions of functions.
• On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials
• Pivotal decomposition schemes inducing clones of operations
• On a quasi-ordering on Boolean functions

This page was built for publication: Composition of Post classes and normal forms of Boolean functions

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