Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)

DOI10.1016/j.dam.2003.09.002zbMath1051.06009OpenAlexW1993769242MaRDI QIDQ1878398

Miguel Couceiro, Stephan Foldes

Publication date: 19 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.002

zbMATH Keywords

ClonesLinear functionsBoolean function classesEquational classesRelational constraints

Mathematics Subject Classification ID

Functional equations for functions with more general domains and/or ranges (39B52) Boolean functions (06E30)

Related Items (3)

Post classes characterized by functional terms ⋮ Galois theory for analogical classifiers ⋮ Polynomial-time quantum algorithms for finding the linear structures of Boolean function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The threshold order of a Boolean function
• Galois theory for minors of finite functions
• On generalized constraints and certificates
• Equational classes of Boolean functions via the HSP theorem
• Post classes characterized by functional terms
• Boolean minors
• Equational characterizations of Boolean function classes
• Closed systems of functions and predicates
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Subsumption of the Theory of Boolean Algebras under the Theory of Rings
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)