Composition of Post classes and normal forms of Boolean functions
From MaRDI portal
Publication:856872
DOI10.1016/j.disc.2006.06.014zbMath1110.06017OpenAlexW2039921034MaRDI QIDQ856872
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
complexitynormal formsBoolean functionsmedianclonesZhegalkin polynomialCNFDNFternary majorityPost classesclass factorizationefficient representationsfunction class compositionReed-Muller polynomial
Related Items
Pivotal decompositions of functions., Pivotal decomposition schemes inducing clones of operations, On a quasi-ordering on Boolean functions, On the efficiency of normal form systems for representing Boolean functions, Invariant continuous aggregation functions, Characterizations of discrete Sugeno integrals as polynomial functions over distributive lattices, Unnamed Item, A complete classification of equational classes of threshold functions included in clones
Cites Work
- Median algebras
- Post classes characterized by functional terms
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
- Median Algebra
- Function classes and relational constraints stable under compositions with cloness
- Ternary Boolean algebra
- A ternary operation in distributive lattices
- Postulates For Distributive Lattices
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item