Algebraic characterizations of small classes of Boolean functions

DOI10.1007/3-540-36494-3_30MaRDI QIDQ4418661zbMATH OpenFDO

Authors Ricard Gavaldà, Denis Thérien

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070331.htm

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Computational learning theory (68Q32) Algebraic theory of languages and automata (68Q70)

Recommendations

• An Algebraic Perspective on Boolean Function Learning
• scientific article; zbMATH DE number 17309
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• Representations of sets of Boolean functions by commutative rings
• A group algebraic approach to NPN classification of Boolean functions

Cited in

(12)

• Representations of sets of Boolean functions by commutative rings
• Learning expressions and programs over monoids
• Characterizing Negabent Boolean Functions over Finite Fields
• An Algebraic Perspective on Boolean Function Learning
• (Nearly-)tight bounds on the contiguity and linearity of cographs
• scientific article; zbMATH DE number 493087 (Why is no real title available?)
• A structure theorem for Boolean functions with small total influences
• Tameness and the power of programs over monoids in \(\mathbf{DA}\)
• A large list of small cardinal characteristics of Boolean algebras
• The power of programs over monoids in DA
• The regular languages of first-order logic with one alternation
• Algebraic and topological closure conditions for classes of pseudo-Boolean functions

This page was built for publication: Algebraic characterizations of small classes of Boolean functions

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